./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya --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.4-dev-0e0057c [2023-11-29 05:56:25,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:56:26,027 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-29 05:56:26,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:56:26,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:56:26,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:56:26,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:56:26,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:56:26,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:56:26,058 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:56:26,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:56:26,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:56:26,060 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:56:26,061 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 05:56:26,061 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 05:56:26,062 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 05:56:26,062 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 05:56:26,063 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 05:56:26,063 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 05:56:26,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:56:26,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 05:56:26,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:56:26,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:56:26,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 05:56:26,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 05:56:26,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 05:56:26,067 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:56:26,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:56:26,068 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 05:56:26,068 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:56:26,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:56:26,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:56:26,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:56:26,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:56:26,070 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 05:56:26,071 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya 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 [2023-11-29 05:56:26,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:56:26,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:56:26,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:56:26,321 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:56:26,322 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:56:26,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2023-11-29 05:56:29,117 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:56:29,319 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:56:29,319 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2023-11-29 05:56:29,325 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/data/3bd27d0e3/34da562964e3474eaeb751b0e3985e9b/FLAGaff308a5b [2023-11-29 05:56:29,337 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/data/3bd27d0e3/34da562964e3474eaeb751b0e3985e9b [2023-11-29 05:56:29,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:56:29,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:56:29,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:56:29,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:56:29,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:56:29,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10ca1ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29, skipping insertion in model container [2023-11-29 05:56:29,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,372 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:56:29,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:56:29,525 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:56:29,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:56:29,557 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:56:29,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29 WrapperNode [2023-11-29 05:56:29,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:56:29,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:56:29,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:56:29,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:56:29,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,600 INFO L138 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2023-11-29 05:56:29,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:56:29,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:56:29,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:56:29,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:56:29,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,632 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]. [2023-11-29 05:56:29,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:56:29,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:56:29,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:56:29,651 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:56:29,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (1/1) ... [2023-11-29 05:56:29,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:29,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:29,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:29,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 05:56:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:56:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:56:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2023-11-29 05:56:29,726 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2023-11-29 05:56:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:56:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:56:29,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:56:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:56:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:56:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:56:29,813 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:56:29,816 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:56:30,040 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:56:30,051 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:56:30,051 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 05:56:30,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:56:30 BoogieIcfgContainer [2023-11-29 05:56:30,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:56:30,055 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 05:56:30,055 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 05:56:30,060 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 05:56:30,061 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 05:56:30,061 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 05:56:29" (1/3) ... [2023-11-29 05:56:30,062 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@251811b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 05:56:30, skipping insertion in model container [2023-11-29 05:56:30,062 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 05:56:30,063 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:29" (2/3) ... [2023-11-29 05:56:30,063 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@251811b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 05:56:30, skipping insertion in model container [2023-11-29 05:56:30,063 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 05:56:30,063 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:56:30" (3/3) ... [2023-11-29 05:56:30,065 INFO L332 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2023-11-29 05:56:30,131 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 05:56:30,131 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 05:56:30,131 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 05:56:30,131 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 05:56:30,131 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 05:56:30,132 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 05:56:30,132 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 05:56:30,132 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 05:56:30,137 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) [2023-11-29 05:56:30,163 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2023-11-29 05:56:30,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:30,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:30,170 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 05:56:30,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:56:30,171 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 05:56:30,171 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) [2023-11-29 05:56:30,175 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2023-11-29 05:56:30,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:30,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:30,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 05:56:30,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:56:30,185 INFO L748 eck$LassoCheckResult]: Stem: 29#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16#L35true assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 10#L40-3true [2023-11-29 05:56:30,185 INFO L750 eck$LassoCheckResult]: Loop: 10#L40-3true assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 11#L40-2true main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 10#L40-3true [2023-11-29 05:56:30,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash 89440, now seen corresponding path program 1 times [2023-11-29 05:56:30,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:30,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635375876] [2023-11-29 05:56:30,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:30,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:30,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:30,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:30,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:30,338 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2023-11-29 05:56:30,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:30,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663501698] [2023-11-29 05:56:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:30,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:30,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:30,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:30,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash 85954242, now seen corresponding path program 1 times [2023-11-29 05:56:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:30,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467643213] [2023-11-29 05:56:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:30,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:30,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:30,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:30,644 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 05:56:30,645 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 05:56:30,645 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 05:56:30,645 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 05:56:30,645 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 05:56:30,645 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:30,645 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 05:56:30,645 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 05:56:30,645 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2023-11-29 05:56:30,646 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 05:56:30,646 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 05:56:30,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:30,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:30,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:30,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:30,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:30,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:30,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:31,063 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 05:56:31,069 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 05:56:31,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:31,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:31,072 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:31,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-29 05:56:31,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:31,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:31,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:31,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:31,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:31,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:31,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:31,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:31,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:31,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:31,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:31,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:31,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:31,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-29 05:56:31,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:31,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:31,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:31,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:31,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:31,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:31,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:31,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:31,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:31,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-11-29 05:56:31,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:31,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:31,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:31,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-29 05:56:31,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:31,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:31,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:31,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:31,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:31,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:31,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:31,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:31,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:31,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-29 05:56:31,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:31,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:31,162 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:31,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-29 05:56:31,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:31,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:31,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:31,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:31,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:31,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:31,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:31,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:31,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:31,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:31,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:31,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:31,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:31,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-29 05:56:31,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:31,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:31,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:31,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:31,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:31,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:31,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:31,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:31,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:31,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-29 05:56:31,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:31,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:31,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:31,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-29 05:56:31,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:31,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:31,236 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-11-29 05:56:31,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:31,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:31,241 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2023-11-29 05:56:31,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:31,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:31,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-29 05:56:31,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:31,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:31,253 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:31,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-29 05:56:31,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:31,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:31,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:31,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:31,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:31,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:31,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:31,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:31,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:31,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-11-29 05:56:31,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:31,280 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:31,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-29 05:56:31,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:31,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:31,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:31,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:31,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:31,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:31,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:31,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:31,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-11-29 05:56:31,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:31,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:31,307 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:31,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-29 05:56:31,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:31,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:31,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:31,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:31,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:31,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:31,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:31,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:31,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-11-29 05:56:31,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:31,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:31,333 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:31,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-29 05:56:31,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:31,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:31,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:31,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:31,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:31,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:31,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:31,370 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 05:56:31,419 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-11-29 05:56:31,419 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2023-11-29 05:56:31,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:31,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:31,449 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:31,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-29 05:56:31,450 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 05:56:31,462 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 05:56:31,463 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 05:56:31,463 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1.offset, v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = -1*ULTIMATE.start_main_~a~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1 - 4*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2023-11-29 05:56:31,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-11-29 05:56:31,478 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-11-29 05:56:31,484 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~a~0!base] could not be translated [2023-11-29 05:56:31,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:31,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:56:31,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:31,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:56:31,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:31,597 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-29 05:56:31,599 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) [2023-11-29 05:56:31,671 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 63 states and 87 transitions. Complement of second has 9 states. [2023-11-29 05:56:31,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 05:56:31,678 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) [2023-11-29 05:56:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2023-11-29 05:56:31,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 3 letters. Loop has 2 letters. [2023-11-29 05:56:31,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:31,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 5 letters. Loop has 2 letters. [2023-11-29 05:56:31,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:31,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 3 letters. Loop has 4 letters. [2023-11-29 05:56:31,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:31,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 87 transitions. [2023-11-29 05:56:31,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-29 05:56:31,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 28 states and 39 transitions. [2023-11-29 05:56:31,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-11-29 05:56:31,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2023-11-29 05:56:31,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2023-11-29 05:56:31,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:56:31,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2023-11-29 05:56:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2023-11-29 05:56:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 05:56:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:56:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2023-11-29 05:56:31,725 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2023-11-29 05:56:31,726 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2023-11-29 05:56:31,726 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 05:56:31,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2023-11-29 05:56:31,727 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-29 05:56:31,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:31,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:31,728 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-29 05:56:31,728 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 05:56:31,728 INFO L748 eck$LassoCheckResult]: Stem: 168#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 152#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; 154#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 155#L40-4 havoc main_~i~1#1; 141#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 142#$Ultimate##0 [2023-11-29 05:56:31,728 INFO L750 eck$LassoCheckResult]: Loop: 142#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 163#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); 144#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 142#$Ultimate##0 [2023-11-29 05:56:31,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:31,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1630387501, now seen corresponding path program 1 times [2023-11-29 05:56:31,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:31,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192412] [2023-11-29 05:56:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:31,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:31,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:31,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192412] [2023-11-29 05:56:31,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:31,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:31,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:56:31,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94904535] [2023-11-29 05:56:31,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:31,816 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:56:31,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:31,817 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 1 times [2023-11-29 05:56:31,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:31,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129245791] [2023-11-29 05:56:31,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:31,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:31,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:31,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:32,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:32,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:56:32,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:56:32,060 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:56:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:32,080 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2023-11-29 05:56:32,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2023-11-29 05:56:32,081 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-29 05:56:32,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2023-11-29 05:56:32,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-11-29 05:56:32,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2023-11-29 05:56:32,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-11-29 05:56:32,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:56:32,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-29 05:56:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-11-29 05:56:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-11-29 05:56:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:56:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-11-29 05:56:32,088 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-11-29 05:56:32,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:56:32,089 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-11-29 05:56:32,090 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 05:56:32,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2023-11-29 05:56:32,091 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-29 05:56:32,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:32,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:32,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:32,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 05:56:32,092 INFO L748 eck$LassoCheckResult]: Stem: 231#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 215#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; 217#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 218#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 219#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 220#L40-4 havoc main_~i~1#1; 204#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 205#$Ultimate##0 [2023-11-29 05:56:32,092 INFO L750 eck$LassoCheckResult]: Loop: 205#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 226#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); 207#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 205#$Ultimate##0 [2023-11-29 05:56:32,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash 862387761, now seen corresponding path program 1 times [2023-11-29 05:56:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:32,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719213245] [2023-11-29 05:56:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:32,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:32,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:32,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 2 times [2023-11-29 05:56:32,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:32,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29684830] [2023-11-29 05:56:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:32,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:32,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:32,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:32,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1100576510, now seen corresponding path program 1 times [2023-11-29 05:56:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:32,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690493260] [2023-11-29 05:56:32,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:32,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:32,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:32,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690493260] [2023-11-29 05:56:32,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690493260] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:32,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871992790] [2023-11-29 05:56:32,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:32,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:56:32,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:32,260 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:56:32,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 05:56:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:32,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:56:32,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:32,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:56:32,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-11-29 05:56:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:32,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871992790] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:56:32,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:56:32,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2023-11-29 05:56:32,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449668926] [2023-11-29 05:56:32,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:56:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:32,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:56:32,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:56:32,607 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:56:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:32,666 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-11-29 05:56:32,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2023-11-29 05:56:32,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-29 05:56:32,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 33 states and 42 transitions. [2023-11-29 05:56:32,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-11-29 05:56:32,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-11-29 05:56:32,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2023-11-29 05:56:32,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:56:32,672 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-11-29 05:56:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2023-11-29 05:56:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2023-11-29 05:56:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:56:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2023-11-29 05:56:32,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2023-11-29 05:56:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:56:32,677 INFO L428 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2023-11-29 05:56:32,677 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 05:56:32,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2023-11-29 05:56:32,679 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-29 05:56:32,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:32,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:32,679 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:32,680 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 05:56:32,680 INFO L748 eck$LassoCheckResult]: Stem: 376#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 358#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 359#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; 361#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 362#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 363#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 364#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 377#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 375#L40-4 havoc main_~i~1#1; 348#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 349#$Ultimate##0 [2023-11-29 05:56:32,680 INFO L750 eck$LassoCheckResult]: Loop: 349#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 370#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); 351#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 349#$Ultimate##0 [2023-11-29 05:56:32,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:32,681 INFO L85 PathProgramCache]: Analyzing trace with hash -172336625, now seen corresponding path program 2 times [2023-11-29 05:56:32,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:32,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818819624] [2023-11-29 05:56:32,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:32,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:32,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:32,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:32,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:32,709 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 3 times [2023-11-29 05:56:32,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:32,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366826719] [2023-11-29 05:56:32,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:32,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:32,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:32,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:32,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:32,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1594476444, now seen corresponding path program 2 times [2023-11-29 05:56:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:32,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003084577] [2023-11-29 05:56:32,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:32,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:32,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:32,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:33,410 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 05:56:33,410 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 05:56:33,410 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 05:56:33,410 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 05:56:33,410 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 05:56:33,410 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:33,411 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 05:56:33,411 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 05:56:33,411 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2023-11-29 05:56:33,411 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 05:56:33,411 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 05:56:33,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:33,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:34,163 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 05:56:34,163 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 05:56:34,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:34,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:34,167 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:34,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-29 05:56:34,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:34,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:34,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:34,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:34,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:34,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:34,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:34,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:34,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:34,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-11-29 05:56:34,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:34,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:34,198 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:34,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-29 05:56:34,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:34,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:34,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:34,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:34,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:34,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:34,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:34,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:34,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:34,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-11-29 05:56:34,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:34,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:34,217 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:34,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-29 05:56:34,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:34,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:34,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:34,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:34,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:34,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:34,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:34,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:34,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:34,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-11-29 05:56:34,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:34,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:34,239 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:34,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-29 05:56:34,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:34,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:34,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:34,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:34,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:34,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:34,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:34,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:34,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:34,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-11-29 05:56:34,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:34,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:34,258 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:34,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-29 05:56:34,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:34,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:34,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:34,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:34,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:34,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:34,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:34,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:34,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:34,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:34,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:34,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:34,280 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:34,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-29 05:56:34,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:34,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:34,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:34,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:34,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:34,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:34,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:34,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:34,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:34,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-11-29 05:56:34,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:34,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:34,299 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:34,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-29 05:56:34,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:34,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:34,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:34,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:34,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:34,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:34,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:34,331 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 05:56:34,354 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2023-11-29 05:56:34,354 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 11 variables to zero. [2023-11-29 05:56:34,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:34,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:34,356 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:34,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-29 05:56:34,361 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 05:56:34,375 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 05:56:34,375 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 05:56:34,375 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1 Supporting invariants [] [2023-11-29 05:56:34,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-11-29 05:56:34,383 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-11-29 05:56:34,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:34,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:56:34,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:34,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:56:34,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:34,488 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 [2023-11-29 05:56:34,489 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:56:34,540 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 60 transitions. Complement of second has 12 states. [2023-11-29 05:56:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 05:56:34,542 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) [2023-11-29 05:56:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2023-11-29 05:56:34,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 10 letters. Loop has 3 letters. [2023-11-29 05:56:34,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:34,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 13 letters. Loop has 3 letters. [2023-11-29 05:56:34,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:34,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2023-11-29 05:56:34,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:34,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2023-11-29 05:56:34,547 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-29 05:56:34,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 39 states and 51 transitions. [2023-11-29 05:56:34,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-11-29 05:56:34,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-11-29 05:56:34,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2023-11-29 05:56:34,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:56:34,549 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-29 05:56:34,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2023-11-29 05:56:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-11-29 05:56:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:56:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2023-11-29 05:56:34,554 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions. [2023-11-29 05:56:34,554 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2023-11-29 05:56:34,554 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 05:56:34,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions. [2023-11-29 05:56:34,555 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-29 05:56:34,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:34,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:34,557 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:34,557 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:34,557 INFO L748 eck$LassoCheckResult]: Stem: 537#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 515#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 516#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; 518#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 519#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 520#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 521#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 538#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 536#L40-4 havoc main_~i~1#1; 504#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 505#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 530#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); 509#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 529#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 531#L24 assume ~n#1 < 2; 527#merge_sortFINAL assume true; 526#merge_sortEXIT >#88#return; 508#L27-1 [2023-11-29 05:56:34,557 INFO L750 eck$LassoCheckResult]: Loop: 508#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 528#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 540#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); 507#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 528#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 540#L24 assume ~n#1 < 2; 517#merge_sortFINAL assume true; 539#merge_sortEXIT >#88#return; 508#L27-1 [2023-11-29 05:56:34,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:34,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1352366372, now seen corresponding path program 1 times [2023-11-29 05:56:34,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:34,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220808061] [2023-11-29 05:56:34,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:34,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:34,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:34,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:34,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1121289573, now seen corresponding path program 1 times [2023-11-29 05:56:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:34,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753061303] [2023-11-29 05:56:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:34,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:34,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:34,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -526901058, now seen corresponding path program 1 times [2023-11-29 05:56:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462516330] [2023-11-29 05:56:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:34,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:34,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:56:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:34,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:56:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:56:34,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:34,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462516330] [2023-11-29 05:56:34,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462516330] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:34,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92199223] [2023-11-29 05:56:34,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:34,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:56:34,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:34,904 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:56:34,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-29 05:56:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:34,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 05:56:35,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:35,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:35,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:56:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:56:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92199223] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:56:35,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:56:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2023-11-29 05:56:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421352512] [2023-11-29 05:56:35,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:56:35,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:35,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:56:35,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:56:35,654 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. cyclomatic complexity: 15 Second operand has 15 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 05:56:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:35,962 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2023-11-29 05:56:35,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 93 transitions. [2023-11-29 05:56:35,965 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2023-11-29 05:56:35,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 88 transitions. [2023-11-29 05:56:35,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2023-11-29 05:56:35,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2023-11-29 05:56:35,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 88 transitions. [2023-11-29 05:56:35,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:56:35,969 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 88 transitions. [2023-11-29 05:56:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 88 transitions. [2023-11-29 05:56:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2023-11-29 05:56:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-29 05:56:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2023-11-29 05:56:35,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 83 transitions. [2023-11-29 05:56:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:56:35,977 INFO L428 stractBuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2023-11-29 05:56:35,977 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 05:56:35,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2023-11-29 05:56:35,979 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-29 05:56:35,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:35,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:35,980 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:35,980 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:35,981 INFO L748 eck$LassoCheckResult]: Stem: 843#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 818#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 819#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; 821#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 822#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 823#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 824#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 857#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 858#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 859#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 854#L40-4 havoc main_~i~1#1; 812#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 850#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 834#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); 811#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 832#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 835#L24 assume ~n#1 < 2; 840#merge_sortFINAL assume true; 829#merge_sortEXIT >#88#return; 810#L27-1 [2023-11-29 05:56:35,981 INFO L750 eck$LassoCheckResult]: Loop: 810#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 831#$Ultimate##0 ~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); 809#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 831#$Ultimate##0 ~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; 872#merge_sortFINAL assume true; 871#merge_sortEXIT >#88#return; 810#L27-1 [2023-11-29 05:56:35,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:35,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1854838534, now seen corresponding path program 2 times [2023-11-29 05:56:35,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:35,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284949373] [2023-11-29 05:56:35,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:35,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:35,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:36,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:36,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1121289573, now seen corresponding path program 2 times [2023-11-29 05:56:36,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:36,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334395972] [2023-11-29 05:56:36,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:36,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:36,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:36,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:36,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:36,028 INFO L85 PathProgramCache]: Analyzing trace with hash 8928416, now seen corresponding path program 2 times [2023-11-29 05:56:36,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:36,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742364491] [2023-11-29 05:56:36,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:36,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:36,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:37,493 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 05:56:37,493 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 05:56:37,493 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 05:56:37,493 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 05:56:37,493 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 05:56:37,493 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:37,493 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 05:56:37,493 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 05:56:37,493 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration6_Lasso [2023-11-29 05:56:37,493 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 05:56:37,493 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 05:56:37,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:37,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:38,246 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 05:56:38,246 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 05:56:38,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:38,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:38,247 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:38,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-29 05:56:38,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:38,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:38,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:38,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:38,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:38,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:38,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:38,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:38,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:38,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-11-29 05:56:38,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:38,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:38,266 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:38,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-29 05:56:38,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:38,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:38,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:38,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:38,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:38,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:38,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:38,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:38,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:38,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-11-29 05:56:38,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:38,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:38,285 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:38,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-29 05:56:38,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:38,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:38,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:38,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:38,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:38,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:38,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:38,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:38,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:38,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:38,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:38,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:38,303 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:38,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-29 05:56:38,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:38,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:38,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:38,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:38,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:38,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:38,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:38,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:38,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:38,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-11-29 05:56:38,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:38,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:38,325 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:38,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-29 05:56:38,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:38,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:38,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:38,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:38,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:38,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:38,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:38,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:38,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:38,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:38,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:38,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:38,346 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:38,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-29 05:56:38,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 [2023-11-29 05:56:38,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:38,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:38,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:38,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:38,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:38,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:38,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:38,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:38,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-11-29 05:56:38,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:38,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:38,366 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:38,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-29 05:56:38,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:38,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:38,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:38,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:38,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:38,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:38,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:38,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:38,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:38,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-11-29 05:56:38,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:38,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:38,384 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:38,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-29 05:56:38,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:38,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:38,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:38,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:38,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:38,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:38,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:38,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:38,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-11-29 05:56:38,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:38,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:38,409 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:38,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-29 05:56:38,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:38,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:38,422 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-11-29 05:56:38,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:38,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:38,425 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2023-11-29 05:56:38,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:38,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:38,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-11-29 05:56:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:38,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:38,438 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:38,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-29 05:56:38,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:38,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:38,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:38,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:38,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:38,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:38,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:38,481 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 05:56:38,582 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2023-11-29 05:56:38,583 INFO L444 ModelExtractionUtils]: 0 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2023-11-29 05:56:38,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:38,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:38,584 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:38,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-29 05:56:38,586 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 05:56:38,598 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2023-11-29 05:56:38,598 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 05:56:38,598 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_~n#1) = 1*merge_sort_~n#1 Supporting invariants [1*merge_sort_~m~0#1 >= 0, -1*merge_sort_~n#1 + 6*merge_sort_~m~0#1 >= 0] [2023-11-29 05:56:38,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-11-29 05:56:38,609 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2023-11-29 05:56:38,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:38,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 05:56:38,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:38,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 05:56:38,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:38,970 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 5 loop predicates [2023-11-29 05:56:38,970 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 23 Second operand has 14 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:56:39,436 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 23. Second operand has 14 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 332 states and 451 transitions. Complement of second has 39 states. [2023-11-29 05:56:39,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 10 stem states 4 non-accepting loop states 2 accepting loop states [2023-11-29 05:56:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:56:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2023-11-29 05:56:39,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 84 transitions. Stem has 19 letters. Loop has 8 letters. [2023-11-29 05:56:39,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:39,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 84 transitions. Stem has 27 letters. Loop has 8 letters. [2023-11-29 05:56:39,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:39,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 84 transitions. Stem has 19 letters. Loop has 16 letters. [2023-11-29 05:56:39,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:39,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 451 transitions. [2023-11-29 05:56:39,448 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2023-11-29 05:56:39,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 250 states and 344 transitions. [2023-11-29 05:56:39,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2023-11-29 05:56:39,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2023-11-29 05:56:39,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 250 states and 344 transitions. [2023-11-29 05:56:39,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:56:39,456 INFO L218 hiAutomatonCegarLoop]: Abstraction has 250 states and 344 transitions. [2023-11-29 05:56:39,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states and 344 transitions. [2023-11-29 05:56:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 224. [2023-11-29 05:56:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 186 states have internal predecessors, (238), 25 states have call successors, (28), 16 states have call predecessors, (28), 15 states have return successors, (32), 21 states have call predecessors, (32), 23 states have call successors, (32) [2023-11-29 05:56:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 298 transitions. [2023-11-29 05:56:39,477 INFO L240 hiAutomatonCegarLoop]: Abstraction has 224 states and 298 transitions. [2023-11-29 05:56:39,477 INFO L428 stractBuchiCegarLoop]: Abstraction has 224 states and 298 transitions. [2023-11-29 05:56:39,477 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-29 05:56:39,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 298 transitions. [2023-11-29 05:56:39,479 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 78 [2023-11-29 05:56:39,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:39,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:39,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:39,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-29 05:56:39,481 INFO L748 eck$LassoCheckResult]: Stem: 1452#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1407#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 1408#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; 1413#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1414#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1415#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1416#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1491#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1490#L40-4 havoc main_~i~1#1; 1390#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1391#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1497#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); 1430#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1431#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1570#L24 assume ~n#1 < 2; 1568#merge_sortFINAL assume true; 1567#merge_sortEXIT >#88#return; 1436#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1435#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1437#L24 assume ~n#1 < 2; 1590#merge_sortFINAL assume true; 1591#merge_sortEXIT >#90#return; 1421#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 1422#L11-3 [2023-11-29 05:56:39,481 INFO L750 eck$LassoCheckResult]: Loop: 1422#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1417#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 1418#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 1449#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 1422#L11-3 [2023-11-29 05:56:39,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash 178168560, now seen corresponding path program 1 times [2023-11-29 05:56:39,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:39,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069955821] [2023-11-29 05:56:39,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:39,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:39,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:39,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:39,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:39,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times [2023-11-29 05:56:39,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:39,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649900071] [2023-11-29 05:56:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:39,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:39,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:39,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:39,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2084911979, now seen corresponding path program 1 times [2023-11-29 05:56:39,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:39,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977118594] [2023-11-29 05:56:39,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:39,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:39,598 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-11-29 05:56:39,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:56:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:39,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:56:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:56:39,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:39,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977118594] [2023-11-29 05:56:39,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977118594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:39,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:39,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:56:39,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760368075] [2023-11-29 05:56:39,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:39,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:39,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:56:39,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:56:39,832 INFO L87 Difference]: Start difference. First operand 224 states and 298 transitions. cyclomatic complexity: 98 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:56:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:39,926 INFO L93 Difference]: Finished difference Result 348 states and 465 transitions. [2023-11-29 05:56:39,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 348 states and 465 transitions. [2023-11-29 05:56:39,932 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 136 [2023-11-29 05:56:39,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 348 states to 348 states and 465 transitions. [2023-11-29 05:56:39,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2023-11-29 05:56:39,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2023-11-29 05:56:39,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 348 states and 465 transitions. [2023-11-29 05:56:39,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:56:39,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 348 states and 465 transitions. [2023-11-29 05:56:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states and 465 transitions. [2023-11-29 05:56:39,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 278. [2023-11-29 05:56:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 238 states have (on average 1.2647058823529411) internal successors, (301), 240 states have internal predecessors, (301), 25 states have call successors, (28), 16 states have call predecessors, (28), 15 states have return successors, (32), 21 states have call predecessors, (32), 23 states have call successors, (32) [2023-11-29 05:56:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 361 transitions. [2023-11-29 05:56:39,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 278 states and 361 transitions. [2023-11-29 05:56:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:56:39,964 INFO L428 stractBuchiCegarLoop]: Abstraction has 278 states and 361 transitions. [2023-11-29 05:56:39,964 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-29 05:56:39,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 278 states and 361 transitions. [2023-11-29 05:56:39,967 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2023-11-29 05:56:39,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:39,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:39,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:39,968 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:39,968 INFO L748 eck$LassoCheckResult]: Stem: 2067#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2005#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 2006#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; 2009#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2010#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2011#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2012#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2073#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 2074#L40-4 havoc main_~i~1#1; 1984#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1985#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2115#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); 2112#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2113#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2121#L24 assume ~n#1 < 2; 2120#merge_sortFINAL assume true; 2119#merge_sortEXIT >#88#return; 2023#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2114#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2255#L24 assume ~n#1 < 2; 2254#merge_sortFINAL assume true; 2022#merge_sortEXIT >#90#return; 2018#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 2019#L11-3 [2023-11-29 05:56:39,969 INFO L750 eck$LassoCheckResult]: Loop: 2019#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 2240#L12 assume !(merge_~j~0#1 == merge_~n#1); 2256#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 2036#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 1986#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 1988#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 2068#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 2063#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 2019#L11-3 [2023-11-29 05:56:39,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash 178168560, now seen corresponding path program 2 times [2023-11-29 05:56:39,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:39,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758867409] [2023-11-29 05:56:39,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:39,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:39,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:40,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:40,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:40,006 INFO L85 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times [2023-11-29 05:56:40,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:40,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035519205] [2023-11-29 05:56:40,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:40,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:40,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:40,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:40,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1066528190, now seen corresponding path program 1 times [2023-11-29 05:56:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:40,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185616897] [2023-11-29 05:56:40,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:40,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:40,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:40,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:41,836 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 05:56:41,836 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 05:56:41,836 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 05:56:41,836 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 05:56:41,836 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 05:56:41,836 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:41,836 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 05:56:41,836 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 05:56:41,836 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration8_Lasso [2023-11-29 05:56:41,836 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 05:56:41,836 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 05:56:41,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:41,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:42,991 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 05:56:42,991 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 05:56:42,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:42,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:42,992 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:42,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-29 05:56:42,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-11-29 05:56:43,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,016 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-11-29 05:56:43,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2023-11-29 05:56:43,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,034 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-11-29 05:56:43,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-11-29 05:56:43,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,052 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-11-29 05:56:43,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:43,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,070 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-11-29 05:56:43,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:43,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,089 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-11-29 05:56:43,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 [2023-11-29 05:56:43,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2023-11-29 05:56:43,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,108 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-11-29 05:56:43,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:43,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:43,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-11-29 05:56:43,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,129 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-11-29 05:56:43,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:43,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:43,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:43,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,150 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-11-29 05:56:43,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2023-11-29 05:56:43,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,168 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-29 05:56:43,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:43,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,187 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-29 05:56:43,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-11-29 05:56:43,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,204 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-29 05:56:43,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:43,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,222 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-11-29 05:56:43,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-11-29 05:56:43,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,240 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-11-29 05:56:43,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-11-29 05:56:43,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,258 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-11-29 05:56:43,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:43,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:43,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:43,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:43,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:43,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-11-29 05:56:43,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:43,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:43,275 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:43,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-11-29 05:56:43,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:43,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:43,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:43,289 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-11-29 05:56:43,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:43,346 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-11-29 05:56:43,346 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-11-29 05:56:43,743 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 05:56:44,928 INFO L443 ModelExtractionUtils]: Simplification made 43 calls to the SMT solver. [2023-11-29 05:56:44,928 INFO L444 ModelExtractionUtils]: 7 out of 100 variables were initially zero. Simplification set additionally 79 variables to zero. [2023-11-29 05:56:44,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:44,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:44,930 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:44,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-11-29 05:56:44,931 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 05:56:44,948 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 8. [2023-11-29 05:56:44,948 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 05:56:44,949 INFO L515 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)_1) = -16*merge_sort_merge_~i~0#1 + 5*v_rep(select #length merge_sort_merge_~x~0#1.base)_1 Supporting invariants [1*merge_sort_merge_~a#1.offset - 1*v_rep(select #length merge_sort_#in~a#1.base)_3 + 8 >= 0, -2*merge_sort_merge_~m#1 + 1*merge_sort_merge_~n#1 >= 0, 3*merge_sort_merge_~a#1.offset + 8*merge_sort_merge_~j~0#1 - 1*v_rep(select #length merge_sort_#in~a#1.base)_3 >= 0, 4*merge_sort_merge_~a#1.offset + 5*v_rep(select #length merge_sort_merge_~x~0#1.base)_1 - 4*v_rep(select #length merge_sort_merge_~a#1.base)_1 >= 0] [2023-11-29 05:56:44,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2023-11-29 05:56:44,998 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2023-11-29 05:56:45,000 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~x~0!base] could not be translated [2023-11-29 05:56:45,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:45,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-29 05:56:45,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:45,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:56:45,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:56:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:45,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:56:45,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:45,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2023-11-29 05:56:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:45,576 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2023-11-29 05:56:45,576 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 278 states and 361 transitions. cyclomatic complexity: 107 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:56:45,937 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 278 states and 361 transitions. cyclomatic complexity: 107. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 382 states and 520 transitions. Complement of second has 17 states. [2023-11-29 05:56:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2023-11-29 05:56:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:56:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2023-11-29 05:56:45,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 23 letters. Loop has 8 letters. [2023-11-29 05:56:45,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:45,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 31 letters. Loop has 8 letters. [2023-11-29 05:56:45,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:45,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 23 letters. Loop has 16 letters. [2023-11-29 05:56:45,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:45,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 382 states and 520 transitions. [2023-11-29 05:56:45,948 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 124 [2023-11-29 05:56:45,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 382 states to 380 states and 516 transitions. [2023-11-29 05:56:45,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2023-11-29 05:56:45,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 265 [2023-11-29 05:56:45,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 380 states and 516 transitions. [2023-11-29 05:56:45,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:56:45,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 380 states and 516 transitions. [2023-11-29 05:56:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states and 516 transitions. [2023-11-29 05:56:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 288. [2023-11-29 05:56:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 248 states have (on average 1.2701612903225807) internal successors, (315), 250 states have internal predecessors, (315), 25 states have call successors, (28), 16 states have call predecessors, (28), 15 states have return successors, (32), 21 states have call predecessors, (32), 23 states have call successors, (32) [2023-11-29 05:56:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 375 transitions. [2023-11-29 05:56:45,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 288 states and 375 transitions. [2023-11-29 05:56:45,974 INFO L428 stractBuchiCegarLoop]: Abstraction has 288 states and 375 transitions. [2023-11-29 05:56:45,974 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-29 05:56:45,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 375 transitions. [2023-11-29 05:56:45,977 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 114 [2023-11-29 05:56:45,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:45,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:45,978 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:45,978 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-29 05:56:45,978 INFO L748 eck$LassoCheckResult]: Stem: 2931#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2869#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 2870#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; 2877#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2878#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2879#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2880#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2974#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 2973#L40-4 havoc main_~i~1#1; 2848#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2849#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2996#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); 2991#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2992#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2997#L24 assume ~n#1 < 2; 2995#merge_sortFINAL assume true; 2990#merge_sortEXIT >#88#return; 2985#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2987#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2993#L24 assume ~n#1 < 2; 2988#merge_sortFINAL assume true; 2984#merge_sortEXIT >#90#return; 2983#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 2981#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 2982#L12 [2023-11-29 05:56:45,978 INFO L750 eck$LassoCheckResult]: Loop: 2982#L12 assume !(merge_~j~0#1 == merge_~n#1); 3016#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 3003#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 3014#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 3013#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 3012#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 2982#L12 [2023-11-29 05:56:45,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:45,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1228258079, now seen corresponding path program 1 times [2023-11-29 05:56:45,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:45,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034575181] [2023-11-29 05:56:45,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:45,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:45,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:46,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:46,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:46,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1482376367, now seen corresponding path program 1 times [2023-11-29 05:56:46,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:46,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272444856] [2023-11-29 05:56:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:46,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:46,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:46,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:46,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:46,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2045529779, now seen corresponding path program 1 times [2023-11-29 05:56:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:46,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95615562] [2023-11-29 05:56:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:46,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:46,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:56:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:46,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:56:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:56:46,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:46,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95615562] [2023-11-29 05:56:46,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95615562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:46,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:46,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:56:46,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034834872] [2023-11-29 05:56:46,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:46,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:56:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:56:46,259 INFO L87 Difference]: Start difference. First operand 288 states and 375 transitions. cyclomatic complexity: 112 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:56:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:46,333 INFO L93 Difference]: Finished difference Result 401 states and 540 transitions. [2023-11-29 05:56:46,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 540 transitions. [2023-11-29 05:56:46,338 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 158 [2023-11-29 05:56:46,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 401 states and 540 transitions. [2023-11-29 05:56:46,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2023-11-29 05:56:46,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2023-11-29 05:56:46,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 540 transitions. [2023-11-29 05:56:46,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:56:46,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 401 states and 540 transitions. [2023-11-29 05:56:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 540 transitions. [2023-11-29 05:56:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 365. [2023-11-29 05:56:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 325 states have (on average 1.2861538461538462) internal successors, (418), 327 states have internal predecessors, (418), 25 states have call successors, (28), 16 states have call predecessors, (28), 15 states have return successors, (32), 21 states have call predecessors, (32), 23 states have call successors, (32) [2023-11-29 05:56:46,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 478 transitions. [2023-11-29 05:56:46,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 365 states and 478 transitions. [2023-11-29 05:56:46,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:56:46,359 INFO L428 stractBuchiCegarLoop]: Abstraction has 365 states and 478 transitions. [2023-11-29 05:56:46,359 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-29 05:56:46,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 478 transitions. [2023-11-29 05:56:46,362 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 156 [2023-11-29 05:56:46,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:46,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:46,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:46,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:46,363 INFO L748 eck$LassoCheckResult]: Stem: 3652#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 3583#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; 3587#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 3588#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 3589#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 3590#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 3660#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 3661#L40-4 havoc main_~i~1#1; 3559#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 3560#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3720#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); 3716#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3717#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3721#L24 assume ~n#1 < 2; 3719#merge_sortFINAL assume true; 3715#merge_sortEXIT >#88#return; 3711#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 3713#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3718#L24 assume ~n#1 < 2; 3714#merge_sortFINAL assume true; 3710#merge_sortEXIT >#90#return; 3709#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 3707#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 3708#L12 [2023-11-29 05:56:46,363 INFO L750 eck$LassoCheckResult]: Loop: 3708#L12 assume !(merge_~j~0#1 == merge_~n#1); 3841#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 3839#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 3836#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 3837#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 3817#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 3818#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 3812#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 3708#L12 [2023-11-29 05:56:46,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:46,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1228258079, now seen corresponding path program 2 times [2023-11-29 05:56:46,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:46,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806869573] [2023-11-29 05:56:46,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:46,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:46,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:46,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:46,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:46,391 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2023-11-29 05:56:46,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:46,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803575653] [2023-11-29 05:56:46,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:46,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:46,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:46,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:46,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1354622765, now seen corresponding path program 1 times [2023-11-29 05:56:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:46,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431310167] [2023-11-29 05:56:46,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:46,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:46,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:48,144 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 05:56:48,144 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 05:56:48,144 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 05:56:48,144 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 05:56:48,144 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 05:56:48,144 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:48,144 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 05:56:48,144 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 05:56:48,144 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration10_Lasso [2023-11-29 05:56:48,144 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 05:56:48,144 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 05:56:48,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:48,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:49,298 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 05:56:49,298 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 05:56:49,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,299 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-11-29 05:56:49,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2023-11-29 05:56:49,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,316 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-11-29 05:56:49,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 [2023-11-29 05:56:49,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-11-29 05:56:49,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,333 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-11-29 05:56:49,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:49,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,351 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-11-29 05:56:49,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2023-11-29 05:56:49,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,368 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-11-29 05:56:49,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 [2023-11-29 05:56:49,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:49,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,385 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-11-29 05:56:49,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,401 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2023-11-29 05:56:49,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,402 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-11-29 05:56:49,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,418 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2023-11-29 05:56:49,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,419 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-11-29 05:56:49,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2023-11-29 05:56:49,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,436 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-11-29 05:56:49,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:49,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,453 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-11-29 05:56:49,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:49,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,470 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-11-29 05:56:49,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:49,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,488 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-11-29 05:56:49,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2023-11-29 05:56:49,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,504 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-11-29 05:56:49,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2023-11-29 05:56:49,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,533 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-11-29 05:56:49,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:49,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:49,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:49,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:49,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,550 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-11-29 05:56:49,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,562 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-11-29 05:56:49,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,567 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2023-11-29 05:56:49,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2023-11-29 05:56:49,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,583 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-11-29 05:56:49,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2023-11-29 05:56:49,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,605 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-11-29 05:56:49,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2023-11-29 05:56:49,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,628 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-11-29 05:56:49,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2023-11-29 05:56:49,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,648 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2023-11-29 05:56:49,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2023-11-29 05:56:49,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,668 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2023-11-29 05:56:49,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2023-11-29 05:56:49,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,687 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-11-29 05:56:49,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 [2023-11-29 05:56:49,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2023-11-29 05:56:49,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,711 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-11-29 05:56:49,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2023-11-29 05:56:49,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,732 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-11-29 05:56:49,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2023-11-29 05:56:49,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,756 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2023-11-29 05:56:49,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:49,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,776 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2023-11-29 05:56:49,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2023-11-29 05:56:49,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,801 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2023-11-29 05:56:49,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2023-11-29 05:56:49,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,822 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2023-11-29 05:56:49,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:49,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:49,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:49,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:49,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:49,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:49,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:49,842 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:49,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2023-11-29 05:56:49,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:49,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:49,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:49,865 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-11-29 05:56:49,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:49,918 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-11-29 05:56:49,919 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-11-29 05:56:50,358 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 05:56:51,290 INFO L443 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2023-11-29 05:56:51,290 INFO L444 ModelExtractionUtils]: 15 out of 100 variables were initially zero. Simplification set additionally 82 variables to zero. [2023-11-29 05:56:51,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:51,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:51,291 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:51,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2023-11-29 05:56:51,293 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 05:56:51,307 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-11-29 05:56:51,307 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 05:56:51,308 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~k~0#1, merge_sort_merge_~n#1) = -1*merge_sort_merge_~k~0#1 + 1*merge_sort_merge_~n#1 Supporting invariants [] [2023-11-29 05:56:51,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2023-11-29 05:56:51,346 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2023-11-29 05:56:51,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:56:51,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:56:51,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:51,488 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-11-29 05:56:51,488 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 478 transitions. cyclomatic complexity: 139 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2023-11-29 05:56:51,552 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 478 transitions. cyclomatic complexity: 139. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 958 states and 1284 transitions. Complement of second has 14 states. [2023-11-29 05:56:51,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 05:56:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2023-11-29 05:56:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2023-11-29 05:56:51,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 24 letters. Loop has 8 letters. [2023-11-29 05:56:51,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:51,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 8 letters. [2023-11-29 05:56:51,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:51,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 24 letters. Loop has 16 letters. [2023-11-29 05:56:51,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:51,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 958 states and 1284 transitions. [2023-11-29 05:56:51,568 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 180 [2023-11-29 05:56:51,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 958 states to 891 states and 1186 transitions. [2023-11-29 05:56:51,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 484 [2023-11-29 05:56:51,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 512 [2023-11-29 05:56:51,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 891 states and 1186 transitions. [2023-11-29 05:56:51,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:56:51,581 INFO L218 hiAutomatonCegarLoop]: Abstraction has 891 states and 1186 transitions. [2023-11-29 05:56:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states and 1186 transitions. [2023-11-29 05:56:51,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 742. [2023-11-29 05:56:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 676 states have (on average 1.3417159763313609) internal successors, (907), 678 states have internal predecessors, (907), 41 states have call successors, (45), 23 states have call predecessors, (45), 25 states have return successors, (77), 40 states have call predecessors, (77), 39 states have call successors, (77) [2023-11-29 05:56:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1029 transitions. [2023-11-29 05:56:51,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 742 states and 1029 transitions. [2023-11-29 05:56:51,612 INFO L428 stractBuchiCegarLoop]: Abstraction has 742 states and 1029 transitions. [2023-11-29 05:56:51,612 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-29 05:56:51,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 742 states and 1029 transitions. [2023-11-29 05:56:51,618 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 162 [2023-11-29 05:56:51,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:51,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:51,618 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:51,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:56:51,619 INFO L748 eck$LassoCheckResult]: Stem: 5142#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5071#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 5072#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; 5075#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 5076#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 5077#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 5078#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 5147#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 5148#L40-4 havoc main_~i~1#1; 5051#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 5052#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5301#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); 5299#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 5300#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5312#L24 assume ~n#1 < 2; 5308#merge_sortFINAL assume true; 5306#merge_sortEXIT >#88#return; 5099#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 5557#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5558#L24 assume ~n#1 < 2; 5556#merge_sortFINAL assume true; 5098#merge_sortEXIT >#90#return; 5100#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 5676#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 5121#L11-4 merge_~i~0#1 := 0; 5125#L17-3 [2023-11-29 05:56:51,619 INFO L750 eck$LassoCheckResult]: Loop: 5125#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 5124#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 5125#L17-3 [2023-11-29 05:56:51,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:51,620 INFO L85 PathProgramCache]: Analyzing trace with hash -578705235, now seen corresponding path program 1 times [2023-11-29 05:56:51,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:51,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974878807] [2023-11-29 05:56:51,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:51,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:56:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:56:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:56:51,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:51,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974878807] [2023-11-29 05:56:51,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974878807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:51,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:51,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:56:51,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193329854] [2023-11-29 05:56:51,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:51,697 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:56:51,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2023-11-29 05:56:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260032754] [2023-11-29 05:56:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:51,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:51,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:51,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:51,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:56:51,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:56:51,774 INFO L87 Difference]: Start difference. First operand 742 states and 1029 transitions. cyclomatic complexity: 334 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:56:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:51,852 INFO L93 Difference]: Finished difference Result 919 states and 1202 transitions. [2023-11-29 05:56:51,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 919 states and 1202 transitions. [2023-11-29 05:56:51,864 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 148 [2023-11-29 05:56:51,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 919 states to 919 states and 1202 transitions. [2023-11-29 05:56:51,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 459 [2023-11-29 05:56:51,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 459 [2023-11-29 05:56:51,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 919 states and 1202 transitions. [2023-11-29 05:56:51,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:56:51,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 919 states and 1202 transitions. [2023-11-29 05:56:51,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states and 1202 transitions. [2023-11-29 05:56:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 671. [2023-11-29 05:56:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 608 states have (on average 1.3157894736842106) internal successors, (800), 611 states have internal predecessors, (800), 38 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (73), 37 states have call predecessors, (73), 36 states have call successors, (73) [2023-11-29 05:56:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 915 transitions. [2023-11-29 05:56:51,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 671 states and 915 transitions. [2023-11-29 05:56:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:56:51,906 INFO L428 stractBuchiCegarLoop]: Abstraction has 671 states and 915 transitions. [2023-11-29 05:56:51,906 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-29 05:56:51,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 671 states and 915 transitions. [2023-11-29 05:56:51,911 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 146 [2023-11-29 05:56:51,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:51,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:51,912 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:51,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 05:56:51,912 INFO L748 eck$LassoCheckResult]: Stem: 6829#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6752#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 6753#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; 6767#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 6768#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 6769#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 6770#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 6834#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 6771#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 6772#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 6826#L40-4 havoc main_~i~1#1; 6812#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 6862#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6860#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); 6796#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6858#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6804#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); 6795#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6797#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6803#L24 assume ~n#1 < 2; 7138#merge_sortFINAL assume true; 7137#merge_sortEXIT >#88#return; 6755#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 7136#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7134#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); 7124#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 7131#$Ultimate##0 [2023-11-29 05:56:51,913 INFO L750 eck$LassoCheckResult]: Loop: 7131#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7133#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); 7127#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 7131#$Ultimate##0 [2023-11-29 05:56:51,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1966073703, now seen corresponding path program 3 times [2023-11-29 05:56:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:51,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362210608] [2023-11-29 05:56:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:52,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2023-11-29 05:56:52,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:56:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:56:52,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:52,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362210608] [2023-11-29 05:56:52,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362210608] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:52,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444674917] [2023-11-29 05:56:52,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:56:52,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:56:52,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:52,141 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:56:52,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2023-11-29 05:56:52,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 05:56:52,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:56:52,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:56:52,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:56:52,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:56:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:56:52,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444674917] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:56:52,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:56:52,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 14 [2023-11-29 05:56:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041471087] [2023-11-29 05:56:52,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:56:52,391 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:56:52,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:52,391 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 4 times [2023-11-29 05:56:52,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:52,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853883098] [2023-11-29 05:56:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:52,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:52,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:52,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:52,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:52,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:56:52,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:56:52,560 INFO L87 Difference]: Start difference. First operand 671 states and 915 transitions. cyclomatic complexity: 281 Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:56:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:52,760 INFO L93 Difference]: Finished difference Result 782 states and 1069 transitions. [2023-11-29 05:56:52,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 782 states and 1069 transitions. [2023-11-29 05:56:52,770 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 172 [2023-11-29 05:56:52,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 782 states to 777 states and 1064 transitions. [2023-11-29 05:56:52,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 405 [2023-11-29 05:56:52,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 408 [2023-11-29 05:56:52,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 777 states and 1064 transitions. [2023-11-29 05:56:52,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:56:52,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 777 states and 1064 transitions. [2023-11-29 05:56:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states and 1064 transitions. [2023-11-29 05:56:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 706. [2023-11-29 05:56:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 639 states have (on average 1.3129890453834117) internal successors, (839), 642 states have internal predecessors, (839), 41 states have call successors, (46), 24 states have call predecessors, (46), 26 states have return successors, (77), 39 states have call predecessors, (77), 38 states have call successors, (77) [2023-11-29 05:56:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 962 transitions. [2023-11-29 05:56:52,807 INFO L240 hiAutomatonCegarLoop]: Abstraction has 706 states and 962 transitions. [2023-11-29 05:56:52,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:56:52,808 INFO L428 stractBuchiCegarLoop]: Abstraction has 706 states and 962 transitions. [2023-11-29 05:56:52,809 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-29 05:56:52,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 706 states and 962 transitions. [2023-11-29 05:56:52,814 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 166 [2023-11-29 05:56:52,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:52,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:52,814 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:52,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 05:56:52,815 INFO L748 eck$LassoCheckResult]: Stem: 8481#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8406#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 8407#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; 8419#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 8420#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 8421#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 8422#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 8423#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 8499#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 8485#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 8476#L40-4 havoc main_~i~1#1; 8457#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 8582#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8579#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); 8573#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 8575#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8580#L24 assume ~n#1 < 2; 8577#merge_sortFINAL assume true; 8572#merge_sortEXIT >#88#return; 8463#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 8570#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8504#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); 8397#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 8491#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8805#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); 8389#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 8940#$Ultimate##0 [2023-11-29 05:56:52,815 INFO L750 eck$LassoCheckResult]: Loop: 8940#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8942#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); 8388#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 8940#$Ultimate##0 [2023-11-29 05:56:52,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1524308723, now seen corresponding path program 4 times [2023-11-29 05:56:52,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:52,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995166952] [2023-11-29 05:56:52,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:52,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:56:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:53,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995166952] [2023-11-29 05:56:53,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995166952] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:53,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062222065] [2023-11-29 05:56:53,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:56:53,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:56:53,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:53,140 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:56:53,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2023-11-29 05:56:53,223 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:56:53,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:56:53,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:56:53,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:56:53,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:56:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:56:53,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062222065] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:56:53,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:56:53,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 22 [2023-11-29 05:56:53,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170755002] [2023-11-29 05:56:53,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:56:53,428 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:56:53,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:53,428 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 5 times [2023-11-29 05:56:53,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:53,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361992985] [2023-11-29 05:56:53,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:53,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:53,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:53,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:53,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 05:56:53,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2023-11-29 05:56:53,590 INFO L87 Difference]: Start difference. First operand 706 states and 962 transitions. cyclomatic complexity: 294 Second operand has 22 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 17 states have internal predecessors, (34), 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) [2023-11-29 05:56:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:54,198 INFO L93 Difference]: Finished difference Result 411 states and 541 transitions. [2023-11-29 05:56:54,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 541 transitions. [2023-11-29 05:56:54,203 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 120 [2023-11-29 05:56:54,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 404 states and 534 transitions. [2023-11-29 05:56:54,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2023-11-29 05:56:54,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2023-11-29 05:56:54,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 404 states and 534 transitions. [2023-11-29 05:56:54,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:56:54,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 404 states and 534 transitions. [2023-11-29 05:56:54,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states and 534 transitions. [2023-11-29 05:56:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 370. [2023-11-29 05:56:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 332 states have (on average 1.2891566265060241) internal successors, (428), 333 states have internal predecessors, (428), 22 states have call successors, (24), 18 states have call predecessors, (24), 16 states have return successors, (37), 18 states have call predecessors, (37), 19 states have call successors, (37) [2023-11-29 05:56:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 489 transitions. [2023-11-29 05:56:54,222 INFO L240 hiAutomatonCegarLoop]: Abstraction has 370 states and 489 transitions. [2023-11-29 05:56:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:56:54,223 INFO L428 stractBuchiCegarLoop]: Abstraction has 370 states and 489 transitions. [2023-11-29 05:56:54,223 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-29 05:56:54,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 370 states and 489 transitions. [2023-11-29 05:56:54,226 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 96 [2023-11-29 05:56:54,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:54,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:54,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:54,227 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:56:54,227 INFO L748 eck$LassoCheckResult]: Stem: 9768#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9727#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 9728#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; 9730#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 9731#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 9732#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 9733#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 9780#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 9781#L40-4 havoc main_~i~1#1; 9709#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 9710#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9873#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); 9865#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 9866#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9872#L24 assume ~n#1 < 2; 9870#merge_sortFINAL assume true; 9864#merge_sortEXIT >#88#return; 9859#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 9860#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9869#L24 assume ~n#1 < 2; 9863#merge_sortFINAL assume true; 9858#merge_sortEXIT >#90#return; 9854#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 9852#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 9847#L12 assume !(merge_~j~0#1 == merge_~n#1); 9798#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 9845#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 9832#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 9826#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 9791#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 9792#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 9788#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 9766#L11-4 merge_~i~0#1 := 0; 9760#L17-3 [2023-11-29 05:56:54,227 INFO L750 eck$LassoCheckResult]: Loop: 9760#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 9758#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 9760#L17-3 [2023-11-29 05:56:54,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1563592709, now seen corresponding path program 1 times [2023-11-29 05:56:54,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:54,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325494265] [2023-11-29 05:56:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:54,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:54,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:56:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:54,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:56:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:56:54,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:54,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325494265] [2023-11-29 05:56:54,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325494265] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:54,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285460672] [2023-11-29 05:56:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:54,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:56:54,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:54,324 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:56:54,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2023-11-29 05:56:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:54,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:56:54,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:56:54,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:56:54,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:56:54,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285460672] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:56:54,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:56:54,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 05:56:54,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48515437] [2023-11-29 05:56:54,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:56:54,517 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:56:54,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2023-11-29 05:56:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:54,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388364711] [2023-11-29 05:56:54,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:54,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:54,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:54,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:54,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:56:54,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:56:54,587 INFO L87 Difference]: Start difference. First operand 370 states and 489 transitions. cyclomatic complexity: 138 Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:56:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:54,686 INFO L93 Difference]: Finished difference Result 680 states and 855 transitions. [2023-11-29 05:56:54,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 680 states and 855 transitions. [2023-11-29 05:56:54,694 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 96 [2023-11-29 05:56:54,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 680 states to 650 states and 821 transitions. [2023-11-29 05:56:54,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 405 [2023-11-29 05:56:54,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 405 [2023-11-29 05:56:54,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 650 states and 821 transitions. [2023-11-29 05:56:54,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:56:54,700 INFO L218 hiAutomatonCegarLoop]: Abstraction has 650 states and 821 transitions. [2023-11-29 05:56:54,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states and 821 transitions. [2023-11-29 05:56:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 418. [2023-11-29 05:56:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 380 states have (on average 1.25) internal successors, (475), 381 states have internal predecessors, (475), 22 states have call successors, (24), 18 states have call predecessors, (24), 16 states have return successors, (37), 18 states have call predecessors, (37), 19 states have call successors, (37) [2023-11-29 05:56:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 536 transitions. [2023-11-29 05:56:54,711 INFO L240 hiAutomatonCegarLoop]: Abstraction has 418 states and 536 transitions. [2023-11-29 05:56:54,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:56:54,711 INFO L428 stractBuchiCegarLoop]: Abstraction has 418 states and 536 transitions. [2023-11-29 05:56:54,712 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-29 05:56:54,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 418 states and 536 transitions. [2023-11-29 05:56:54,714 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 96 [2023-11-29 05:56:54,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:54,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:54,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:54,715 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:56:54,715 INFO L748 eck$LassoCheckResult]: Stem: 11051#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11001#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 11002#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; 11006#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 11007#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 11008#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 11009#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 11010#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 11062#L40-4 havoc main_~i~1#1; 10979#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 10980#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 11072#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); 11073#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 11192#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 11139#L24 assume ~n#1 < 2; 11128#merge_sortFINAL assume true; 11129#merge_sortEXIT >#88#return; 11019#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 11041#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 11206#L24 assume ~n#1 < 2; 11198#merge_sortFINAL assume true; 11018#merge_sortEXIT >#90#return; 11020#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 11321#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 11320#L12 assume !(merge_~j~0#1 == merge_~n#1); 11290#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 11309#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 11306#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 11305#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 11304#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 11292#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 11291#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 11287#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 11288#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 11323#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 11069#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 11068#L11-4 merge_~i~0#1 := 0; 11042#L17-3 [2023-11-29 05:56:54,715 INFO L750 eck$LassoCheckResult]: Loop: 11042#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 11043#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 11042#L17-3 [2023-11-29 05:56:54,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash -412481570, now seen corresponding path program 1 times [2023-11-29 05:56:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:54,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717042105] [2023-11-29 05:56:54,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:54,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:54,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:54,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:54,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2023-11-29 05:56:54,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:54,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837333721] [2023-11-29 05:56:54,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:54,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:54,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:54,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:54,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:54,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1257795936, now seen corresponding path program 1 times [2023-11-29 05:56:54,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:54,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759213514] [2023-11-29 05:56:54,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:54,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:54,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:54,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:56:57,435 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 05:56:57,435 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 05:56:57,435 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 05:56:57,435 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 05:56:57,435 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 05:56:57,435 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:57,435 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 05:56:57,435 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 05:56:57,435 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration15_Lasso [2023-11-29 05:56:57,435 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 05:56:57,436 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 05:56:57,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:57,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:57,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:57,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:57,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:57,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:56:58,583 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 05:56:58,583 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 05:56:58,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:58,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:58,584 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:58,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2023-11-29 05:56:58,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:58,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:58,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:58,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:58,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:58,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:58,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:58,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:58,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2023-11-29 05:56:58,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:58,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:58,603 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:58,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2023-11-29 05:56:58,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:58,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:58,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:58,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:58,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:58,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:58,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:58,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:58,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:58,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2023-11-29 05:56:58,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:58,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:58,620 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:58,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2023-11-29 05:56:58,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:58,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:58,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:58,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:58,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:58,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:58,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:58,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:58,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:58,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:58,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:58,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:58,638 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:58,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2023-11-29 05:56:58,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:58,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:58,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:58,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:58,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:58,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:58,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:58,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:58,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:58,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:58,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:58,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:58,655 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:58,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2023-11-29 05:56:58,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:58,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:58,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:58,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:58,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:58,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:58,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:58,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:58,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:58,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2023-11-29 05:56:58,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:58,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:58,672 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:58,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2023-11-29 05:56:58,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:58,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:58,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:58,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:58,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:58,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:58,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:58,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:58,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2023-11-29 05:56:58,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:58,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:58,713 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:58,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2023-11-29 05:56:58,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 [2023-11-29 05:56:58,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:58,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:56:58,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:58,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:58,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:58,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:56:58,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:56:58,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:56:58,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:58,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:58,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:58,730 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:58,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2023-11-29 05:56:58,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:56:58,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:56:58,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:56:58,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:56:58,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:56:58,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:56:58,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:56:58,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 05:56:58,775 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-11-29 05:56:58,775 INFO L444 ModelExtractionUtils]: 10 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. [2023-11-29 05:56:58,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:56:58,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:58,776 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:56:58,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2023-11-29 05:56:58,778 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 05:56:58,789 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 05:56:58,789 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 05:56:58,789 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, merge_sort_merge_~n#1) = -1*merge_sort_merge_~i~0#1 + 1*merge_sort_merge_~n#1 Supporting invariants [] [2023-11-29 05:56:58,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2023-11-29 05:56:58,817 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2023-11-29 05:56:58,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2023-11-29 05:56:58,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:56:58,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:56:58,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:58,993 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-11-29 05:56:58,994 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 418 states and 536 transitions. cyclomatic complexity: 137 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:56:59,035 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 418 states and 536 transitions. cyclomatic complexity: 137. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 440 states and 569 transitions. Complement of second has 12 states. [2023-11-29 05:56:59,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 05:56:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:56:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2023-11-29 05:56:59,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 37 letters. Loop has 2 letters. [2023-11-29 05:56:59,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:59,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 39 letters. Loop has 2 letters. [2023-11-29 05:56:59,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:59,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 37 letters. Loop has 4 letters. [2023-11-29 05:56:59,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:56:59,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 440 states and 569 transitions. [2023-11-29 05:56:59,041 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 92 [2023-11-29 05:56:59,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 440 states to 357 states and 459 transitions. [2023-11-29 05:56:59,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 274 [2023-11-29 05:56:59,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 277 [2023-11-29 05:56:59,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 357 states and 459 transitions. [2023-11-29 05:56:59,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:56:59,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 357 states and 459 transitions. [2023-11-29 05:56:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states and 459 transitions. [2023-11-29 05:56:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2023-11-29 05:56:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 323 states have (on average 1.2538699690402477) internal successors, (405), 324 states have internal predecessors, (405), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (33), 16 states have call predecessors, (33), 17 states have call successors, (33) [2023-11-29 05:56:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 457 transitions. [2023-11-29 05:56:59,053 INFO L240 hiAutomatonCegarLoop]: Abstraction has 355 states and 457 transitions. [2023-11-29 05:56:59,053 INFO L428 stractBuchiCegarLoop]: Abstraction has 355 states and 457 transitions. [2023-11-29 05:56:59,053 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-11-29 05:56:59,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 355 states and 457 transitions. [2023-11-29 05:56:59,056 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 92 [2023-11-29 05:56:59,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:56:59,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:56:59,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:59,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:59,057 INFO L748 eck$LassoCheckResult]: Stem: 12092#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12041#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 12042#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; 12045#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 12046#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 12047#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 12048#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 12101#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 12100#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 12097#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 12088#L40-4 havoc main_~i~1#1; 12021#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 12022#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12178#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); 12171#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 12172#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12177#L24 assume ~n#1 < 2; 12176#merge_sortFINAL assume true; 12170#merge_sortEXIT >#88#return; 12166#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 12168#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12226#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); 12222#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 12223#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12227#L24 assume ~n#1 < 2; 12225#merge_sortFINAL assume true; 12221#merge_sortEXIT >#88#return; 12218#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 12219#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12224#L24 assume ~n#1 < 2; 12220#merge_sortFINAL assume true; 12217#merge_sortEXIT >#90#return; 12216#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 12215#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 12214#L12 assume !(merge_~j~0#1 == merge_~n#1); 12191#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 12210#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 12209#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 12206#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 12204#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 12201#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 12197#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 12189#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 12188#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 12187#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 12186#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 12185#L11-4 merge_~i~0#1 := 0; 12183#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 12179#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 12173#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 12169#merge_sortFINAL assume true; 12165#merge_sortEXIT >#90#return; 12164#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 12163#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 12162#L12 assume !(merge_~j~0#1 == merge_~n#1); 12161#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 12159#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 12156#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 12154#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 12152#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 12150#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 12148#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 12144#L12 [2023-11-29 05:56:59,057 INFO L750 eck$LassoCheckResult]: Loop: 12144#L12 assume !(merge_~j~0#1 == merge_~n#1); 12145#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 12157#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 12158#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 12228#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 12140#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 12138#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 12139#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 12144#L12 [2023-11-29 05:56:59,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:59,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1365976563, now seen corresponding path program 1 times [2023-11-29 05:56:59,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:59,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982888171] [2023-11-29 05:56:59,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:59,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:59,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:56:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:59,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:56:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:59,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:59,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:56:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-29 05:56:59,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982888171] [2023-11-29 05:56:59,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982888171] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701365727] [2023-11-29 05:56:59,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:59,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:56:59,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:59,190 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:56:59,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2023-11-29 05:56:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:59,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 05:56:59,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 05:56:59,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:56:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 05:56:59,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701365727] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:56:59,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:56:59,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 27 [2023-11-29 05:56:59,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841214354] [2023-11-29 05:56:59,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:56:59,814 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:56:59,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:59,814 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2023-11-29 05:56:59,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:59,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387436856] [2023-11-29 05:56:59,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:59,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:59,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:56:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:56:59,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:57:00,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:00,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 05:57:00,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2023-11-29 05:57:00,048 INFO L87 Difference]: Start difference. First operand 355 states and 457 transitions. cyclomatic complexity: 119 Second operand has 27 states, 25 states have (on average 3.8) internal successors, (95), 22 states have internal predecessors, (95), 9 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-29 05:57:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:00,986 INFO L93 Difference]: Finished difference Result 654 states and 841 transitions. [2023-11-29 05:57:00,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 654 states and 841 transitions. [2023-11-29 05:57:00,990 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 226 [2023-11-29 05:57:00,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 654 states to 646 states and 833 transitions. [2023-11-29 05:57:00,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 518 [2023-11-29 05:57:00,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 518 [2023-11-29 05:57:00,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 646 states and 833 transitions. [2023-11-29 05:57:00,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:57:00,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 646 states and 833 transitions. [2023-11-29 05:57:00,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states and 833 transitions. [2023-11-29 05:57:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 361. [2023-11-29 05:57:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 328 states have (on average 1.2408536585365855) internal successors, (407), 329 states have internal predecessors, (407), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (39), 17 states have call predecessors, (39), 18 states have call successors, (39) [2023-11-29 05:57:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 466 transitions. [2023-11-29 05:57:01,004 INFO L240 hiAutomatonCegarLoop]: Abstraction has 361 states and 466 transitions. [2023-11-29 05:57:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 05:57:01,006 INFO L428 stractBuchiCegarLoop]: Abstraction has 361 states and 466 transitions. [2023-11-29 05:57:01,006 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-11-29 05:57:01,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 361 states and 466 transitions. [2023-11-29 05:57:01,008 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 92 [2023-11-29 05:57:01,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:57:01,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:57:01,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:01,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:01,010 INFO L748 eck$LassoCheckResult]: Stem: 13596#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13548#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 13549#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; 13553#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 13554#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 13555#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 13556#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 13605#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 13604#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 13601#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 13592#L40-4 havoc main_~i~1#1; 13532#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 13533#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13665#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); 13659#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 13662#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13666#L24 assume ~n#1 < 2; 13663#merge_sortFINAL assume true; 13658#merge_sortEXIT >#88#return; 13551#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 13657#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13655#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); 13651#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 13652#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13656#L24 assume ~n#1 < 2; 13654#merge_sortFINAL assume true; 13650#merge_sortEXIT >#88#return; 13647#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 13648#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13653#L24 assume ~n#1 < 2; 13649#merge_sortFINAL assume true; 13646#merge_sortEXIT >#90#return; 13645#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 13644#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13643#L12 assume !(merge_~j~0#1 == merge_~n#1); 13625#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 13640#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 13642#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 13677#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 13676#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 13675#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 13674#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13622#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 13621#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 13620#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 13619#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 13614#L11-4 merge_~i~0#1 := 0; 13613#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 13612#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 13584#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 13585#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 13808#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 13807#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 13550#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 13552#merge_sortFINAL assume true; 13564#merge_sortEXIT >#90#return; 13562#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 13563#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13884#L12 assume !(merge_~j~0#1 == merge_~n#1); 13883#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 13881#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 13879#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 13880#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 13597#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 13598#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 13577#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13578#L12 [2023-11-29 05:57:01,010 INFO L750 eck$LassoCheckResult]: Loop: 13578#L12 assume !(merge_~j~0#1 == merge_~n#1); 13542#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 13543#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 13534#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 13535#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 13877#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 13876#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 13875#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13578#L12 [2023-11-29 05:57:01,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash 875722351, now seen corresponding path program 1 times [2023-11-29 05:57:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829547874] [2023-11-29 05:57:01,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:01,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:57:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:01,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:57:01,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2023-11-29 05:57:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:01,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436436243] [2023-11-29 05:57:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:01,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:57:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:01,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:57:01,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash 817267747, now seen corresponding path program 2 times [2023-11-29 05:57:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341948004] [2023-11-29 05:57:01,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:01,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:01,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:57:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:01,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:57:17,937 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 05:57:17,937 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 05:57:17,937 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 05:57:17,937 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 05:57:17,937 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 05:57:17,937 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:17,937 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 05:57:17,937 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 05:57:17,937 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration17_Lasso [2023-11-29 05:57:17,937 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 05:57:17,937 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 05:57:17,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:17,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:19,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:19,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:19,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:19,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:19,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:19,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:19,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:19,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:19,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:19,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:19,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:19,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:57:20,829 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 05:57:20,829 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 05:57:20,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:20,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:20,830 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:20,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2023-11-29 05:57:20,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:20,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:20,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:20,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:20,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:20,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:20,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:20,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:20,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:20,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2023-11-29 05:57:20,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:20,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:20,847 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:20,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2023-11-29 05:57:20,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:20,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:20,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:20,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:20,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:20,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:20,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:20,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:20,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:20,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2023-11-29 05:57:20,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:20,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:20,864 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:20,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2023-11-29 05:57:20,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:20,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:20,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:20,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:20,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:20,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:20,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:20,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:20,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:20,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2023-11-29 05:57:20,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:20,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:20,882 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:20,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2023-11-29 05:57:20,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:20,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:20,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:20,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:20,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:20,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:20,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:20,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:20,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:20,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2023-11-29 05:57:20,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:20,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:20,899 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:20,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2023-11-29 05:57:20,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:20,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:20,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:20,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:20,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:20,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:20,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:20,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:20,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:20,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2023-11-29 05:57:20,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:20,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:20,917 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:20,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2023-11-29 05:57:20,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:20,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:20,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:20,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:20,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:20,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:20,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:20,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:20,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:20,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2023-11-29 05:57:20,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:20,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:20,934 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:20,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2023-11-29 05:57:20,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:20,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:20,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:20,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:20,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:20,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:20,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:20,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:20,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:20,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2023-11-29 05:57:20,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:20,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:20,950 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:20,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2023-11-29 05:57:20,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:20,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:20,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:20,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:20,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:20,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:20,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:20,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:20,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:20,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2023-11-29 05:57:20,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:20,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:20,968 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:20,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2023-11-29 05:57:20,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:20,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:20,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:20,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:20,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:20,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:20,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:20,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:20,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:20,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2023-11-29 05:57:20,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:20,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:20,986 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:20,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2023-11-29 05:57:20,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:20,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:20,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:20,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:20,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:20,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:20,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:20,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:20,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:21,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2023-11-29 05:57:21,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:21,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,003 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2023-11-29 05:57:21,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 [2023-11-29 05:57:21,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:21,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:21,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:21,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:21,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:21,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:21,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:21,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:21,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2023-11-29 05:57:21,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:21,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,020 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2023-11-29 05:57:21,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:21,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:21,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:21,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:21,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:21,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:57:21,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:57:21,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:21,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2023-11-29 05:57:21,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:21,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,039 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2023-11-29 05:57:21,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:21,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:21,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:21,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:21,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:21,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:21,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:21,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:21,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:21,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2023-11-29 05:57:21,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:21,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,056 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2023-11-29 05:57:21,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:21,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:21,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:21,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:21,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:21,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:21,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:21,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:21,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:21,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2023-11-29 05:57:21,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:21,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,073 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2023-11-29 05:57:21,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:21,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:21,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:21,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:21,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:21,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:21,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:21,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:21,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:21,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2023-11-29 05:57:21,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:21,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,090 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2023-11-29 05:57:21,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 [2023-11-29 05:57:21,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:21,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:21,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:21,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:21,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:57:21,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:57:21,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:21,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2023-11-29 05:57:21,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:21,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,117 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2023-11-29 05:57:21,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:21,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:21,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:57:21,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:21,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:21,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:21,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:57:21,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:57:21,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:21,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2023-11-29 05:57:21,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:21,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,134 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2023-11-29 05:57:21,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:21,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:21,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:21,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:21,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:21,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:57:21,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:57:21,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:21,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2023-11-29 05:57:21,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:21,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,154 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2023-11-29 05:57:21,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:21,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:21,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:21,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:57:21,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:21,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:57:21,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:57:21,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:57:21,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2023-11-29 05:57:21,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:21,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,177 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2023-11-29 05:57:21,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:57:21,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:57:21,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:57:21,190 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-29 05:57:21,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:57:21,211 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-11-29 05:57:21,211 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-11-29 05:57:21,295 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 05:57:21,961 INFO L443 ModelExtractionUtils]: Simplification made 57 calls to the SMT solver. [2023-11-29 05:57:21,961 INFO L444 ModelExtractionUtils]: 20 out of 66 variables were initially zero. Simplification set additionally 38 variables to zero. [2023-11-29 05:57:21,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:57:21,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,963 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2023-11-29 05:57:21,965 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 05:57:21,978 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 4. [2023-11-29 05:57:21,978 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 05:57:21,978 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~k~0#1) = -4*merge_sort_merge_~k~0#1 + 18446744073709551609 Supporting invariants [-1*v_rep(select #length merge_sort_merge_~a#1.base)_4 + 12 >= 0, 1*merge_sort_merge_~x~0#1.offset - 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_4 + 18446744073709551612 >= 0] [2023-11-29 05:57:21,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2023-11-29 05:57:22,125 INFO L156 tatePredicateManager]: 26 out of 27 supporting invariants were superfluous and have been removed [2023-11-29 05:57:22,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:22,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 05:57:22,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:22,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2023-11-29 05:57:22,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:57:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:22,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:57:22,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:57:22,608 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2023-11-29 05:57:22,608 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 361 states and 466 transitions. cyclomatic complexity: 122 Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:57:22,724 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 361 states and 466 transitions. cyclomatic complexity: 122. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 458 states and 599 transitions. Complement of second has 10 states. [2023-11-29 05:57:22,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 05:57:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:57:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2023-11-29 05:57:22,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 66 letters. Loop has 8 letters. [2023-11-29 05:57:22,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:57:22,725 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 05:57:22,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:22,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 05:57:22,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:23,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:57:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:23,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:57:23,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:57:23,270 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2023-11-29 05:57:23,270 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 361 states and 466 transitions. cyclomatic complexity: 122 Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:57:23,393 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 361 states and 466 transitions. cyclomatic complexity: 122. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 464 states and 605 transitions. Complement of second has 12 states. [2023-11-29 05:57:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-29 05:57:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:57:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2023-11-29 05:57:23,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 66 letters. Loop has 8 letters. [2023-11-29 05:57:23,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:57:23,394 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 05:57:23,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:23,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 05:57:23,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:23,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:57:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:23,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:57:23,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:57:23,918 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2023-11-29 05:57:23,919 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 361 states and 466 transitions. cyclomatic complexity: 122 Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:57:24,052 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 361 states and 466 transitions. cyclomatic complexity: 122. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 583 states and 761 transitions. Complement of second has 19 states. [2023-11-29 05:57:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 05:57:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:57:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2023-11-29 05:57:24,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 55 transitions. Stem has 66 letters. Loop has 8 letters. [2023-11-29 05:57:24,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:57:24,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 55 transitions. Stem has 74 letters. Loop has 8 letters. [2023-11-29 05:57:24,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:57:24,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 55 transitions. Stem has 66 letters. Loop has 16 letters. [2023-11-29 05:57:24,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:57:24,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 583 states and 761 transitions. [2023-11-29 05:57:24,060 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2023-11-29 05:57:24,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 583 states to 361 states and 466 transitions. [2023-11-29 05:57:24,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2023-11-29 05:57:24,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2023-11-29 05:57:24,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 361 states and 466 transitions. [2023-11-29 05:57:24,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:57:24,065 INFO L218 hiAutomatonCegarLoop]: Abstraction has 361 states and 466 transitions. [2023-11-29 05:57:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states and 466 transitions. [2023-11-29 05:57:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2023-11-29 05:57:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 328 states have (on average 1.2408536585365855) internal successors, (407), 329 states have internal predecessors, (407), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (39), 17 states have call predecessors, (39), 18 states have call successors, (39) [2023-11-29 05:57:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 466 transitions. [2023-11-29 05:57:24,076 INFO L240 hiAutomatonCegarLoop]: Abstraction has 361 states and 466 transitions. [2023-11-29 05:57:24,077 INFO L428 stractBuchiCegarLoop]: Abstraction has 361 states and 466 transitions. [2023-11-29 05:57:24,077 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-11-29 05:57:24,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 361 states and 466 transitions. [2023-11-29 05:57:24,079 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2023-11-29 05:57:24,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:57:24,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:57:24,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:24,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:57:24,081 INFO L748 eck$LassoCheckResult]: Stem: 16336#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 16282#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 16283#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; 16286#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 16287#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 16288#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 16289#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 16346#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 16345#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 16342#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 16331#L40-4 havoc main_~i~1#1; 16262#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 16263#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16446#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); 16439#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 16441#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16444#L24 assume ~n#1 < 2; 16443#merge_sortFINAL assume true; 16438#merge_sortEXIT >#88#return; 16318#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 16437#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16435#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); 16431#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 16432#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16436#L24 assume ~n#1 < 2; 16434#merge_sortFINAL assume true; 16430#merge_sortEXIT >#88#return; 16427#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 16428#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16433#L24 assume ~n#1 < 2; 16429#merge_sortFINAL assume true; 16426#merge_sortEXIT >#90#return; 16425#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 16424#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16423#L12 assume !(merge_~j~0#1 == merge_~n#1); 16404#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 16418#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 16419#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 16416#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 16413#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 16411#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 16407#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16402#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 16397#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 16396#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 16395#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 16394#L11-4 merge_~i~0#1 := 0; 16393#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 16392#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 16323#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 16317#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 16319#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 16502#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 16503#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 16500#merge_sortFINAL assume true; 16501#merge_sortEXIT >#90#return; 16476#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 16532#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16531#L12 assume !(merge_~j~0#1 == merge_~n#1); 16530#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 16528#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 16525#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 16523#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 16521#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 16519#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 16517#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16512#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 16513#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 16504#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 16505#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 16465#L11-4 merge_~i~0#1 := 0; 16316#L17-3 [2023-11-29 05:57:24,081 INFO L750 eck$LassoCheckResult]: Loop: 16316#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 16314#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 16316#L17-3 [2023-11-29 05:57:24,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1252013118, now seen corresponding path program 3 times [2023-11-29 05:57:24,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:24,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296186421] [2023-11-29 05:57:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:24,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:57:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:24,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:24,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:57:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:24,553 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 28 proven. 27 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 05:57:24,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:24,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296186421] [2023-11-29 05:57:24,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296186421] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:24,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120311307] [2023-11-29 05:57:24,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:57:24,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:24,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:24,555 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:57:24,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2023-11-29 05:57:24,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 05:57:24,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:57:24,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:57:24,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 31 proven. 21 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 05:57:24,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:57:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 31 proven. 21 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 05:57:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120311307] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:57:24,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:57:24,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2023-11-29 05:57:24,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175025992] [2023-11-29 05:57:24,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:57:24,989 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:57:24,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:24,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 4 times [2023-11-29 05:57:24,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:24,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082658828] [2023-11-29 05:57:24,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:24,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:24,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:57:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:24,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:57:25,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:25,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 05:57:25,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2023-11-29 05:57:25,040 INFO L87 Difference]: Start difference. First operand 361 states and 466 transitions. cyclomatic complexity: 122 Second operand has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 21 states have internal predecessors, (106), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:57:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:26,251 INFO L93 Difference]: Finished difference Result 794 states and 974 transitions. [2023-11-29 05:57:26,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 794 states and 974 transitions. [2023-11-29 05:57:26,256 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 28 [2023-11-29 05:57:26,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 794 states to 794 states and 974 transitions. [2023-11-29 05:57:26,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2023-11-29 05:57:26,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2023-11-29 05:57:26,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 794 states and 974 transitions. [2023-11-29 05:57:26,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:57:26,262 INFO L218 hiAutomatonCegarLoop]: Abstraction has 794 states and 974 transitions. [2023-11-29 05:57:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states and 974 transitions. [2023-11-29 05:57:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 483. [2023-11-29 05:57:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 450 states have (on average 1.22) internal successors, (549), 450 states have internal predecessors, (549), 20 states have call successors, (20), 15 states have call predecessors, (20), 13 states have return successors, (35), 17 states have call predecessors, (35), 18 states have call successors, (35) [2023-11-29 05:57:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 604 transitions. [2023-11-29 05:57:26,273 INFO L240 hiAutomatonCegarLoop]: Abstraction has 483 states and 604 transitions. [2023-11-29 05:57:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-29 05:57:26,273 INFO L428 stractBuchiCegarLoop]: Abstraction has 483 states and 604 transitions. [2023-11-29 05:57:26,273 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-11-29 05:57:26,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 483 states and 604 transitions. [2023-11-29 05:57:26,275 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2023-11-29 05:57:26,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:57:26,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:57:26,276 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:26,276 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:57:26,276 INFO L748 eck$LassoCheckResult]: Stem: 18051#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 18002#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 18003#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; 18006#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 18007#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 18008#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 18009#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 18063#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 18062#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 18059#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 18050#L40-4 havoc main_~i~1#1; 17982#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 17983#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 18132#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); 18126#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 18128#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 18133#L24 assume ~n#1 < 2; 18129#merge_sortFINAL assume true; 18125#merge_sortEXIT >#88#return; 17985#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 18136#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 18135#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); 18016#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 18131#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 18134#L24 assume ~n#1 < 2; 18130#merge_sortFINAL assume true; 18015#merge_sortEXIT >#88#return; 18017#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 18027#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 18028#L24 assume ~n#1 < 2; 18044#merge_sortFINAL assume true; 18243#merge_sortEXIT >#90#return; 18242#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 18241#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 18240#L12 assume !(merge_~j~0#1 == merge_~n#1); 18073#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 18092#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 18091#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 18090#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 18088#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 18084#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 18085#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 18072#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 18052#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 18046#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 18047#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 18227#L11-4 merge_~i~0#1 := 0; 18226#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 18039#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 18040#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 18043#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 18222#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 18223#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 18004#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 18005#merge_sortFINAL assume true; 18096#merge_sortEXIT >#90#return; 18097#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 18294#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 18293#L12 assume !(merge_~j~0#1 == merge_~n#1); 18292#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 18290#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 18289#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 18288#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 18287#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 18286#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 18285#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 18284#L12 assume !(merge_~j~0#1 == merge_~n#1); 18283#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 18281#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 18280#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 18279#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 18278#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 18277#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 18276#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 18272#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 18273#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 18295#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 18296#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 18049#L11-4 merge_~i~0#1 := 0; 18038#L17-3 [2023-11-29 05:57:26,276 INFO L750 eck$LassoCheckResult]: Loop: 18038#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 18036#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 18038#L17-3 [2023-11-29 05:57:26,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1300508302, now seen corresponding path program 4 times [2023-11-29 05:57:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:26,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78509979] [2023-11-29 05:57:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:26,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:57:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:26,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:57:26,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:26,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 5 times [2023-11-29 05:57:26,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:26,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652908226] [2023-11-29 05:57:26,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:26,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:26,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:57:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:26,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:57:26,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:26,362 INFO L85 PathProgramCache]: Analyzing trace with hash -47003312, now seen corresponding path program 5 times [2023-11-29 05:57:26,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:26,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682288609] [2023-11-29 05:57:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:26,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:26,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:57:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:26,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:57:48,476 WARN L293 SmtUtils]: Spent 17.62s on a formula simplification. DAG size of input: 329 DAG size of output: 281 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 05:58:03,831 WARN L293 SmtUtils]: Spent 8.84s on a formula simplification. DAG size of input: 190 DAG size of output: 184 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 05:58:09,508 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 05:58:09,508 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 05:58:09,508 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 05:58:09,508 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 05:58:09,508 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 05:58:09,508 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:09,508 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 05:58:09,508 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 05:58:09,509 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration19_Lasso [2023-11-29 05:58:09,509 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 05:58:09,509 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 05:58:09,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:09,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:09,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:14,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:15,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:58:16,677 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 05:58:16,677 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 05:58:16,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,678 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2023-11-29 05:58:16,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:16,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:58:16,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:58:16,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:58:16,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2023-11-29 05:58:16,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,696 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2023-11-29 05:58:16,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:16,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:58:16,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:58:16,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2023-11-29 05:58:16,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,718 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2023-11-29 05:58:16,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 [2023-11-29 05:58:16,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:58:16,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:58:16,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2023-11-29 05:58:16,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,747 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2023-11-29 05:58:16,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:16,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:58:16,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:58:16,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:58:16,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2023-11-29 05:58:16,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,764 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2023-11-29 05:58:16,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 [2023-11-29 05:58:16,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:58:16,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:58:16,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2023-11-29 05:58:16,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,785 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2023-11-29 05:58:16,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:16,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:58:16,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:58:16,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2023-11-29 05:58:16,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,805 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2023-11-29 05:58:16,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:16,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:58:16,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:58:16,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2023-11-29 05:58:16,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,846 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2023-11-29 05:58:16,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:16,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:58:16,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:58:16,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2023-11-29 05:58:16,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,869 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2023-11-29 05:58:16,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:16,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:58:16,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:58:16,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2023-11-29 05:58:16,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,889 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2023-11-29 05:58:16,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:16,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:58:16,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:58:16,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:58:16,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2023-11-29 05:58:16,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,905 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2023-11-29 05:58:16,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:16,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:58:16,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:58:16,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2023-11-29 05:58:16,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,933 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2023-11-29 05:58:16,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:16,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:58:16,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:58:16,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2023-11-29 05:58:16,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,952 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2023-11-29 05:58:16,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:16,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:58:16,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:16,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:58:16,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:58:16,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:16,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2023-11-29 05:58:16,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:16,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:16,970 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:16,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2023-11-29 05:58:16,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:16,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:16,983 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2023-11-29 05:58:16,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:16,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:16,990 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2023-11-29 05:58:16,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:58:17,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:58:17,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2023-11-29 05:58:17,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:17,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:17,013 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:17,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2023-11-29 05:58:17,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:58:17,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:58:17,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:58:17,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:58:17,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:58:17,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:58:17,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:58:17,079 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 05:58:17,244 INFO L443 ModelExtractionUtils]: Simplification made 37 calls to the SMT solver. [2023-11-29 05:58:17,244 INFO L444 ModelExtractionUtils]: 12 out of 67 variables were initially zero. Simplification set additionally 49 variables to zero. [2023-11-29 05:58:17,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:58:17,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:17,245 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:58:17,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2023-11-29 05:58:17,247 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 05:58:17,258 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-29 05:58:17,258 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 05:58:17,258 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select old(#length) merge_sort_~a#1.base)_2, merge_sort_merge_~i~0#1) = 1537228672809129301*v_rep(select old(#length) merge_sort_~a#1.base)_2 - 4*merge_sort_merge_~i~0#1 Supporting invariants [1537228672809129301*v_rep(select old(#length) merge_sort_~a#1.base)_2 - 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_5 + 1*merge_sort_merge_~x~0#1.offset >= 0] [2023-11-29 05:58:17,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2023-11-29 05:58:17,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2023-11-29 05:58:17,921 INFO L156 tatePredicateManager]: 40 out of 41 supporting invariants were superfluous and have been removed [2023-11-29 05:58:17,923 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#length)[~a!base] could not be translated [2023-11-29 05:58:17,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 05:58:18,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:18,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:58:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:58:18,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:58:18,506 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2023-11-29 05:58:18,507 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 483 states and 604 transitions. cyclomatic complexity: 141 Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:58:18,721 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 483 states and 604 transitions. cyclomatic complexity: 141. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 521 states and 659 transitions. Complement of second has 13 states. [2023-11-29 05:58:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2023-11-29 05:58:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:58:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2023-11-29 05:58:18,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 79 letters. Loop has 2 letters. [2023-11-29 05:58:18,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:58:18,723 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 05:58:18,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 05:58:18,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:19,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:58:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:19,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:58:19,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:58:19,320 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2023-11-29 05:58:19,320 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 483 states and 604 transitions. cyclomatic complexity: 141 Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:58:19,542 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 483 states and 604 transitions. cyclomatic complexity: 141. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 521 states and 659 transitions. Complement of second has 13 states. [2023-11-29 05:58:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2023-11-29 05:58:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:58:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2023-11-29 05:58:19,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 79 letters. Loop has 2 letters. [2023-11-29 05:58:19,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:58:19,544 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 05:58:19,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:19,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 05:58:19,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:19,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:58:19,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:58:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:20,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:58:20,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:58:20,169 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2023-11-29 05:58:20,169 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 483 states and 604 transitions. cyclomatic complexity: 141 Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:58:20,500 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 483 states and 604 transitions. cyclomatic complexity: 141. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 750 states and 940 transitions. Complement of second has 16 states. [2023-11-29 05:58:20,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 1 non-accepting loop states 2 accepting loop states [2023-11-29 05:58:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:58:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2023-11-29 05:58:20,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 66 transitions. Stem has 79 letters. Loop has 2 letters. [2023-11-29 05:58:20,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:58:20,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 66 transitions. Stem has 81 letters. Loop has 2 letters. [2023-11-29 05:58:20,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:58:20,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 66 transitions. Stem has 79 letters. Loop has 4 letters. [2023-11-29 05:58:20,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:58:20,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 750 states and 940 transitions. [2023-11-29 05:58:20,509 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2023-11-29 05:58:20,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 750 states to 604 states and 759 transitions. [2023-11-29 05:58:20,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2023-11-29 05:58:20,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2023-11-29 05:58:20,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 759 transitions. [2023-11-29 05:58:20,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:58:20,515 INFO L218 hiAutomatonCegarLoop]: Abstraction has 604 states and 759 transitions. [2023-11-29 05:58:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 759 transitions. [2023-11-29 05:58:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 512. [2023-11-29 05:58:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 480 states have (on average 1.2229166666666667) internal successors, (587), 479 states have internal predecessors, (587), 22 states have call successors, (22), 12 states have call predecessors, (22), 10 states have return successors, (42), 20 states have call predecessors, (42), 19 states have call successors, (42) [2023-11-29 05:58:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 651 transitions. [2023-11-29 05:58:20,529 INFO L240 hiAutomatonCegarLoop]: Abstraction has 512 states and 651 transitions. [2023-11-29 05:58:20,529 INFO L428 stractBuchiCegarLoop]: Abstraction has 512 states and 651 transitions. [2023-11-29 05:58:20,529 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2023-11-29 05:58:20,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 512 states and 651 transitions. [2023-11-29 05:58:20,532 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 16 [2023-11-29 05:58:20,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:58:20,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:58:20,533 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:58:20,533 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:58:20,534 INFO L748 eck$LassoCheckResult]: Stem: 21351#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 21305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 21309#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 21310#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 21311#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 21312#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 21361#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 21360#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 21359#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 21358#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 21357#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 21350#L40-4 havoc main_~i~1#1; 21279#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 21280#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21362#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); 21286#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 21323#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21328#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); 21298#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 21412#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21414#L24 assume ~n#1 < 2; 21413#merge_sortFINAL assume true; 21411#merge_sortEXIT >#88#return; 21282#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 21408#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21406#L24 assume ~n#1 < 2; 21407#merge_sortFINAL assume true; 21399#merge_sortEXIT >#90#return; 21397#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 21398#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 21394#L12 assume !(merge_~j~0#1 == merge_~n#1); 21367#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 21505#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 21504#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 21503#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 21502#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 21501#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 21500#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 21364#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 21353#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 21356#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 21329#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 21330#L11-4 merge_~i~0#1 := 0; 21491#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 21441#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 21440#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 21439#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 21438#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 21437#merge_sortFINAL assume true; 21436#merge_sortEXIT >#88#return; 21289#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 21336#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21416#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); 21343#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 21418#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21339#L24 assume ~n#1 < 2; 21344#merge_sortFINAL assume true; 21421#merge_sortEXIT >#88#return; 21419#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 21424#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21425#L24 assume ~n#1 < 2; 21344#merge_sortFINAL assume true; 21421#merge_sortEXIT >#90#return; 21422#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 21576#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 21575#L12 assume !(merge_~j~0#1 == merge_~n#1); 21574#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 21571#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 21568#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 21566#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 21564#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 21562#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 21560#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 21559#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 21555#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 21519#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 21520#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 21488#L11-4 merge_~i~0#1 := 0; 21487#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 21443#L17-2 [2023-11-29 05:58:20,534 INFO L750 eck$LassoCheckResult]: Loop: 21443#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 21442#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 21443#L17-2 [2023-11-29 05:58:20,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:20,534 INFO L85 PathProgramCache]: Analyzing trace with hash -448227466, now seen corresponding path program 6 times [2023-11-29 05:58:20,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:20,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546629729] [2023-11-29 05:58:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:20,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:58:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:20,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:58:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:20,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:58:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:20,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:58:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:20,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:58:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 05:58:20,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:58:20,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546629729] [2023-11-29 05:58:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546629729] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:58:20,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691223959] [2023-11-29 05:58:20,852 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 05:58:20,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:58:20,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:20,853 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:58:20,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2023-11-29 05:58:21,111 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-11-29 05:58:21,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:58:21,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:58:21,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 70 proven. 6 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-29 05:58:21,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:58:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 46 proven. 14 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 05:58:21,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691223959] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:58:21,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:58:21,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2023-11-29 05:58:21,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229808891] [2023-11-29 05:58:21,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:58:21,239 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:58:21,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 6 times [2023-11-29 05:58:21,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:21,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069032683] [2023-11-29 05:58:21,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:21,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:21,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:58:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:21,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:58:21,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:58:21,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:58:21,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:58:21,295 INFO L87 Difference]: Start difference. First operand 512 states and 651 transitions. cyclomatic complexity: 161 Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:58:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:21,576 INFO L93 Difference]: Finished difference Result 1007 states and 1295 transitions. [2023-11-29 05:58:21,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1007 states and 1295 transitions. [2023-11-29 05:58:21,582 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 26 [2023-11-29 05:58:21,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1007 states to 1007 states and 1295 transitions. [2023-11-29 05:58:21,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2023-11-29 05:58:21,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2023-11-29 05:58:21,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1007 states and 1295 transitions. [2023-11-29 05:58:21,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:58:21,590 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1007 states and 1295 transitions. [2023-11-29 05:58:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states and 1295 transitions. [2023-11-29 05:58:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 528. [2023-11-29 05:58:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 496 states have (on average 1.215725806451613) internal successors, (603), 495 states have internal predecessors, (603), 22 states have call successors, (22), 12 states have call predecessors, (22), 10 states have return successors, (42), 20 states have call predecessors, (42), 19 states have call successors, (42) [2023-11-29 05:58:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 667 transitions. [2023-11-29 05:58:21,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 528 states and 667 transitions. [2023-11-29 05:58:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:58:21,609 INFO L428 stractBuchiCegarLoop]: Abstraction has 528 states and 667 transitions. [2023-11-29 05:58:21,609 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2023-11-29 05:58:21,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 528 states and 667 transitions. [2023-11-29 05:58:21,612 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 16 [2023-11-29 05:58:21,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:58:21,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:58:21,613 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:58:21,613 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:58:21,614 INFO L748 eck$LassoCheckResult]: Stem: 23438#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 23388#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 23389#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; 23392#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 23393#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 23394#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 23395#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 23396#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 23442#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 23441#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 23440#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 23439#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 23434#L40-4 havoc main_~i~1#1; 23363#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 23364#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23443#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); 23371#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 23414#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23415#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); 23375#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 23408#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23427#L24 assume ~n#1 < 2; 23428#merge_sortFINAL assume true; 23467#merge_sortEXIT >#88#return; 23366#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 23465#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23463#L24 assume ~n#1 < 2; 23404#merge_sortFINAL assume true; 23405#merge_sortEXIT >#90#return; 23604#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 23603#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 23602#L12 assume !(merge_~j~0#1 == merge_~n#1); 23535#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 23552#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 23576#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 23573#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 23563#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 23561#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 23560#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 23532#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 23530#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 23527#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 23525#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 23506#L11-4 merge_~i~0#1 := 0; 23505#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 23504#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 23503#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 23494#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 23493#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 23479#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 23475#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 23473#merge_sortFINAL assume true; 23470#merge_sortEXIT >#88#return; 23372#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 23445#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23446#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); 23406#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 23407#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23413#L24 assume ~n#1 < 2; 23455#merge_sortFINAL assume true; 23456#merge_sortEXIT >#88#return; 23423#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 23457#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23464#L24 assume ~n#1 < 2; 23455#merge_sortFINAL assume true; 23456#merge_sortEXIT >#90#return; 23458#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 23643#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 23642#L12 assume !(merge_~j~0#1 == merge_~n#1); 23641#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 23639#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 23638#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 23637#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 23636#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 23635#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 23633#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 23629#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 23630#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 23654#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 23653#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 23502#L11-4 merge_~i~0#1 := 0; 23501#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 23500#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 23499#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 23496#L17-2 [2023-11-29 05:58:21,614 INFO L750 eck$LassoCheckResult]: Loop: 23496#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 23495#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 23496#L17-2 [2023-11-29 05:58:21,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1947256842, now seen corresponding path program 7 times [2023-11-29 05:58:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922467238] [2023-11-29 05:58:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:21,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:58:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:21,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:58:21,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:21,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 7 times [2023-11-29 05:58:21,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144131281] [2023-11-29 05:58:21,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:21,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:21,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:58:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:21,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:58:21,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1291917556, now seen corresponding path program 8 times [2023-11-29 05:58:21,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:21,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449434115] [2023-11-29 05:58:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:21,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:22,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:58:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:58:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:22,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:58:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:58:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:22,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:58:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 51 proven. 43 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-29 05:58:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:58:22,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449434115] [2023-11-29 05:58:22,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449434115] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:58:22,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265661858] [2023-11-29 05:58:22,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:58:22,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:58:22,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:22,612 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:58:22,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2023-11-29 05:58:22,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:58:22,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:58:22,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 05:58:22,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 05:58:22,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:58:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 05:58:23,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265661858] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:58:23,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:58:23,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 30 [2023-11-29 05:58:23,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75194471] [2023-11-29 05:58:23,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:58:23,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:58:23,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 05:58:23,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2023-11-29 05:58:23,301 INFO L87 Difference]: Start difference. First operand 528 states and 667 transitions. cyclomatic complexity: 161 Second operand has 31 states, 27 states have (on average 3.814814814814815) internal successors, (103), 26 states have internal predecessors, (103), 9 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-29 05:58:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:24,529 INFO L93 Difference]: Finished difference Result 1434 states and 1854 transitions. [2023-11-29 05:58:24,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1434 states and 1854 transitions. [2023-11-29 05:58:24,537 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 16 [2023-11-29 05:58:24,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1434 states to 531 states and 670 transitions. [2023-11-29 05:58:24,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2023-11-29 05:58:24,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2023-11-29 05:58:24,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 531 states and 670 transitions. [2023-11-29 05:58:24,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:58:24,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 531 states and 670 transitions. [2023-11-29 05:58:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states and 670 transitions. [2023-11-29 05:58:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 530. [2023-11-29 05:58:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 498 states have (on average 1.214859437751004) internal successors, (605), 497 states have internal predecessors, (605), 22 states have call successors, (22), 12 states have call predecessors, (22), 10 states have return successors, (42), 20 states have call predecessors, (42), 19 states have call successors, (42) [2023-11-29 05:58:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 669 transitions. [2023-11-29 05:58:24,553 INFO L240 hiAutomatonCegarLoop]: Abstraction has 530 states and 669 transitions. [2023-11-29 05:58:24,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-29 05:58:24,553 INFO L428 stractBuchiCegarLoop]: Abstraction has 530 states and 669 transitions. [2023-11-29 05:58:24,554 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2023-11-29 05:58:24,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 669 transitions. [2023-11-29 05:58:24,556 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 16 [2023-11-29 05:58:24,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:58:24,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:58:24,557 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:58:24,557 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:58:24,557 INFO L748 eck$LassoCheckResult]: Stem: 26054#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 26002#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 26003#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; 26006#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 26007#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 26008#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 26009#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 26062#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 26061#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 26060#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 26059#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 26058#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 26057#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 26056#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 26049#L40-4 havoc main_~i~1#1; 25980#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 25981#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26065#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); 25997#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26021#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26026#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); 25983#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26111#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26114#L24 assume ~n#1 < 2; 26113#merge_sortFINAL assume true; 26110#merge_sortEXIT >#88#return; 26099#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 26108#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26106#L24 assume ~n#1 < 2; 26107#merge_sortFINAL assume true; 26097#merge_sortEXIT >#90#return; 26095#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 26093#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 26091#L12 assume !(merge_~j~0#1 == merge_~n#1); 26070#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 26087#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 26086#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 26083#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 26084#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 26192#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 26076#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 26068#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 26051#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 26185#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 26184#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 26183#L11-4 merge_~i~0#1 := 0; 26182#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 26181#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 26180#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 26179#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 26178#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 26173#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 26174#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 26169#merge_sortFINAL assume true; 26170#merge_sortEXIT >#88#return; 26016#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 26034#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26208#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); 26039#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26124#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26038#L24 assume ~n#1 < 2; 26043#merge_sortFINAL assume true; 26127#merge_sortEXIT >#88#return; 26117#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 26132#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26133#L24 assume ~n#1 < 2; 26043#merge_sortFINAL assume true; 26127#merge_sortEXIT >#90#return; 26128#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 26297#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 26296#L12 assume !(merge_~j~0#1 == merge_~n#1); 26295#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 26293#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 26290#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 26288#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 26286#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 26284#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 26282#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 26279#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 26280#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 26306#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 26305#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 26216#L11-4 merge_~i~0#1 := 0; 26215#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 26209#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 26210#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 26202#L17-2 [2023-11-29 05:58:24,557 INFO L750 eck$LassoCheckResult]: Loop: 26202#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 26203#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 26202#L17-2 [2023-11-29 05:58:24,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1808516820, now seen corresponding path program 9 times [2023-11-29 05:58:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:24,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838420379] [2023-11-29 05:58:24,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:24,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:58:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:25,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:58:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:25,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:58:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:58:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:25,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:58:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 62 proven. 38 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-29 05:58:25,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:58:25,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838420379] [2023-11-29 05:58:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838420379] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:58:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573985034] [2023-11-29 05:58:25,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:58:25,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:58:25,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:25,220 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:58:25,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2023-11-29 05:58:25,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 05:58:25,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:58:25,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:58:25,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 60 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-29 05:58:25,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:58:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 60 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-29 05:58:25,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573985034] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:58:25,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:58:25,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 27 [2023-11-29 05:58:25,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033309546] [2023-11-29 05:58:25,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:58:25,962 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:58:25,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:25,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 8 times [2023-11-29 05:58:25,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:25,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706643928] [2023-11-29 05:58:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:25,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:58:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:25,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:58:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:58:26,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 05:58:26,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2023-11-29 05:58:26,033 INFO L87 Difference]: Start difference. First operand 530 states and 669 transitions. cyclomatic complexity: 161 Second operand has 27 states, 23 states have (on average 4.043478260869565) internal successors, (93), 24 states have internal predecessors, (93), 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) [2023-11-29 05:58:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:26,568 INFO L93 Difference]: Finished difference Result 604 states and 758 transitions. [2023-11-29 05:58:26,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 604 states and 758 transitions. [2023-11-29 05:58:26,572 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 16 [2023-11-29 05:58:26,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 604 states to 600 states and 754 transitions. [2023-11-29 05:58:26,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2023-11-29 05:58:26,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2023-11-29 05:58:26,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 600 states and 754 transitions. [2023-11-29 05:58:26,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:58:26,577 INFO L218 hiAutomatonCegarLoop]: Abstraction has 600 states and 754 transitions. [2023-11-29 05:58:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states and 754 transitions. [2023-11-29 05:58:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 569. [2023-11-29 05:58:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 535 states have (on average 1.2112149532710281) internal successors, (648), 534 states have internal predecessors, (648), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (46), 22 states have call predecessors, (46), 21 states have call successors, (46) [2023-11-29 05:58:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 718 transitions. [2023-11-29 05:58:26,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 569 states and 718 transitions. [2023-11-29 05:58:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 05:58:26,587 INFO L428 stractBuchiCegarLoop]: Abstraction has 569 states and 718 transitions. [2023-11-29 05:58:26,588 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2023-11-29 05:58:26,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 569 states and 718 transitions. [2023-11-29 05:58:26,591 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 16 [2023-11-29 05:58:26,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:58:26,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:58:26,592 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:58:26,592 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:58:26,592 INFO L748 eck$LassoCheckResult]: Stem: 27815#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 27768#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 27769#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; 27774#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 27775#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 27776#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 27777#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 27824#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 27823#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 27822#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 27821#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 27820#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 27819#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 27818#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 27811#L40-4 havoc main_~i~1#1; 27743#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 27744#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 27826#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); 27758#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 27788#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 27795#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); 27754#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 27875#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 27877#L24 assume ~n#1 < 2; 27876#merge_sortFINAL assume true; 27874#merge_sortEXIT >#88#return; 27862#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 27871#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 27869#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); 27867#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 27865#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 27872#L24 assume ~n#1 < 2; 27866#merge_sortFINAL assume true; 27868#merge_sortEXIT >#88#return; 27864#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 27865#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 27872#L24 assume ~n#1 < 2; 27866#merge_sortFINAL assume true; 27868#merge_sortEXIT >#90#return; 27873#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 27922#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 27921#L12 assume !(merge_~j~0#1 == merge_~n#1); 27898#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 27917#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 27916#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 27913#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 27911#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 27908#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 27904#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 27896#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 27895#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 27894#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 27893#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 27892#L11-4 merge_~i~0#1 := 0; 27891#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 27890#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 27889#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 27888#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 27887#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 27886#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 27885#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 27884#merge_sortFINAL assume true; 27880#merge_sortEXIT >#90#return; 27882#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 28072#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 28071#L12 assume !(merge_~j~0#1 == merge_~n#1); 28070#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 28068#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 28067#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 28066#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 28065#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 28064#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 28063#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 28062#L12 assume !(merge_~j~0#1 == merge_~n#1); 28061#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 28059#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 28058#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 28057#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 28056#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 28055#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 28054#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 28049#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 28050#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 28073#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 28052#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 27941#L11-4 merge_~i~0#1 := 0; 27939#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 27937#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 27935#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 27933#L17-2 [2023-11-29 05:58:26,592 INFO L750 eck$LassoCheckResult]: Loop: 27933#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 27932#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 27933#L17-2 [2023-11-29 05:58:26,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:26,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1733977025, now seen corresponding path program 10 times [2023-11-29 05:58:26,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:26,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959626033] [2023-11-29 05:58:26,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:26,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:27,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:58:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:27,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:58:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:58:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:27,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:58:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 59 proven. 51 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-29 05:58:27,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:58:27,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959626033] [2023-11-29 05:58:27,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959626033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:58:27,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104964513] [2023-11-29 05:58:27,271 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:58:27,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:58:27,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:27,272 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:58:27,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2023-11-29 05:58:27,709 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:58:27,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:58:27,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:58:27,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 57 proven. 47 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-29 05:58:27,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:58:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 57 proven. 47 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-29 05:58:28,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104964513] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:58:28,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:58:28,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 26 [2023-11-29 05:58:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198546442] [2023-11-29 05:58:28,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:58:28,011 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:58:28,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:28,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 9 times [2023-11-29 05:58:28,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:28,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488269778] [2023-11-29 05:58:28,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:28,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:28,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:58:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:28,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:58:28,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:58:28,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:58:28,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:58:28,062 INFO L87 Difference]: Start difference. First operand 569 states and 718 transitions. cyclomatic complexity: 172 Second operand has 26 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 23 states have internal predecessors, (84), 7 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-29 05:58:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:28,628 INFO L93 Difference]: Finished difference Result 939 states and 1168 transitions. [2023-11-29 05:58:28,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 939 states and 1168 transitions. [2023-11-29 05:58:28,635 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 20 [2023-11-29 05:58:28,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 939 states to 830 states and 1029 transitions. [2023-11-29 05:58:28,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2023-11-29 05:58:28,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2023-11-29 05:58:28,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 830 states and 1029 transitions. [2023-11-29 05:58:28,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:58:28,643 INFO L218 hiAutomatonCegarLoop]: Abstraction has 830 states and 1029 transitions. [2023-11-29 05:58:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states and 1029 transitions. [2023-11-29 05:58:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 624. [2023-11-29 05:58:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 585 states have (on average 1.2153846153846153) internal successors, (711), 583 states have internal predecessors, (711), 28 states have call successors, (28), 16 states have call predecessors, (28), 11 states have return successors, (49), 24 states have call predecessors, (49), 24 states have call successors, (49) [2023-11-29 05:58:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 788 transitions. [2023-11-29 05:58:28,660 INFO L240 hiAutomatonCegarLoop]: Abstraction has 624 states and 788 transitions. [2023-11-29 05:58:28,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 05:58:28,661 INFO L428 stractBuchiCegarLoop]: Abstraction has 624 states and 788 transitions. [2023-11-29 05:58:28,661 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2023-11-29 05:58:28,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 624 states and 788 transitions. [2023-11-29 05:58:28,663 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 16 [2023-11-29 05:58:28,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:58:28,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:58:28,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:58:28,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:58:28,665 INFO L748 eck$LassoCheckResult]: Stem: 29983#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 29924#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 29925#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; 29927#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 29928#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 29929#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 29930#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 30001#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 30000#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 29999#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 29998#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 29997#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 29996#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 29990#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 29992#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 29993#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 29981#L40-4 havoc main_~i~1#1; 29982#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 29994#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 29995#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); 29919#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 29959#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 29960#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); 29907#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 29953#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30061#L24 assume ~n#1 < 2; 30078#merge_sortFINAL assume true; 30064#merge_sortEXIT >#88#return; 29916#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 30083#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30081#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 30074#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 30080#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30082#L24 assume ~n#1 < 2; 30079#merge_sortFINAL assume true; 30073#merge_sortEXIT >#88#return; 30075#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 30080#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30082#L24 assume ~n#1 < 2; 30079#merge_sortFINAL assume true; 30073#merge_sortEXIT >#90#return; 30076#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 30055#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 30056#L12 assume !(merge_~j~0#1 == merge_~n#1); 30006#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 30046#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 30243#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 30242#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 30239#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 30020#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 30021#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 30004#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 29985#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 29976#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 29977#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 29979#L11-4 merge_~i~0#1 := 0; 29980#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 29966#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 29967#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 30032#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 30033#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 29914#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 29917#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 29926#merge_sortFINAL assume true; 29936#merge_sortEXIT >#90#return; 29937#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 29961#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 29962#L12 assume !(merge_~j~0#1 == merge_~n#1); 30425#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 30423#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 30422#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 30421#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 30420#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 30419#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 30418#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 30417#L12 assume !(merge_~j~0#1 == merge_~n#1); 30416#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 30414#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 30413#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 30412#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 30411#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 30410#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 30409#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 30405#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 30406#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 30426#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 30427#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 30177#L11-4 merge_~i~0#1 := 0; 30176#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 30175#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 30174#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 30173#L17-2 [2023-11-29 05:58:28,665 INFO L750 eck$LassoCheckResult]: Loop: 30173#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 30172#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 30173#L17-2 [2023-11-29 05:58:28,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash 222668833, now seen corresponding path program 11 times [2023-11-29 05:58:28,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:28,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882050414] [2023-11-29 05:58:28,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:28,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:28,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:58:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:28,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:58:28,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:28,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 10 times [2023-11-29 05:58:28,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:28,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486440315] [2023-11-29 05:58:28,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:28,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:28,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:58:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:28,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:58:28,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:28,781 INFO L85 PathProgramCache]: Analyzing trace with hash -763614625, now seen corresponding path program 12 times [2023-11-29 05:58:28,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:28,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334631506] [2023-11-29 05:58:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:28,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:28,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:58:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:28,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:58:54,352 WARN L293 SmtUtils]: Spent 20.82s on a formula simplification. DAG size of input: 364 DAG size of output: 303 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 05:59:08,463 WARN L293 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 172 DAG size of output: 171 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 05:59:26,960 WARN L293 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 217 DAG size of output: 209 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 05:59:27,983 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 05:59:27,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 05:59:27,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 05:59:27,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 05:59:27,983 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 05:59:27,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:27,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 05:59:27,984 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 05:59:27,984 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration24_Lasso [2023-11-29 05:59:27,984 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 05:59:27,984 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 05:59:27,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:27,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:27,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:27,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:27,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:27,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:27,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:27,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:27,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:27,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:28,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:29,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:29,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:29,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:29,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:29,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:29,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:29,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:29,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:29,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:29,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:59:29,935 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 05:59:29,935 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 05:59:29,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:29,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:29,936 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:29,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2023-11-29 05:59:29,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:29,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:29,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:29,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:29,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:29,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:29,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:29,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:29,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:29,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2023-11-29 05:59:29,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:29,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:29,953 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:29,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2023-11-29 05:59:29,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:29,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:29,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:29,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:29,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:29,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:29,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:29,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:29,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2023-11-29 05:59:29,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:29,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:29,973 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:29,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2023-11-29 05:59:29,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:29,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:29,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:29,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:29,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:29,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:29,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:29,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:29,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2023-11-29 05:59:29,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:29,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:29,993 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:29,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2023-11-29 05:59:29,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2023-11-29 05:59:30,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,011 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2023-11-29 05:59:30,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2023-11-29 05:59:30,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,028 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2023-11-29 05:59:30,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2023-11-29 05:59:30,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,046 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2023-11-29 05:59:30,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2023-11-29 05:59:30,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,074 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2023-11-29 05:59:30,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2023-11-29 05:59:30,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,092 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2023-11-29 05:59:30,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:30,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:30,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2023-11-29 05:59:30,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,110 INFO L229 MonitoredProcess]: Starting monitored process 144 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2023-11-29 05:59:30,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2023-11-29 05:59:30,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,128 INFO L229 MonitoredProcess]: Starting monitored process 145 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2023-11-29 05:59:30,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2023-11-29 05:59:30,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,145 INFO L229 MonitoredProcess]: Starting monitored process 146 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2023-11-29 05:59:30,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2023-11-29 05:59:30,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,163 INFO L229 MonitoredProcess]: Starting monitored process 147 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2023-11-29 05:59:30,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:30,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:30,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2023-11-29 05:59:30,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,182 INFO L229 MonitoredProcess]: Starting monitored process 148 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2023-11-29 05:59:30,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2023-11-29 05:59:30,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,200 INFO L229 MonitoredProcess]: Starting monitored process 149 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2023-11-29 05:59:30,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2023-11-29 05:59:30,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,217 INFO L229 MonitoredProcess]: Starting monitored process 150 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2023-11-29 05:59:30,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2023-11-29 05:59:30,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,235 INFO L229 MonitoredProcess]: Starting monitored process 151 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2023-11-29 05:59:30,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:30,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:30,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2023-11-29 05:59:30,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,255 INFO L229 MonitoredProcess]: Starting monitored process 152 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2023-11-29 05:59:30,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2023-11-29 05:59:30,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,272 INFO L229 MonitoredProcess]: Starting monitored process 153 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2023-11-29 05:59:30,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:30,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:30,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2023-11-29 05:59:30,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,292 INFO L229 MonitoredProcess]: Starting monitored process 154 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2023-11-29 05:59:30,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2023-11-29 05:59:30,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,308 INFO L229 MonitoredProcess]: Starting monitored process 155 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2023-11-29 05:59:30,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2023-11-29 05:59:30,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,325 INFO L229 MonitoredProcess]: Starting monitored process 156 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2023-11-29 05:59:30,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2023-11-29 05:59:30,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,344 INFO L229 MonitoredProcess]: Starting monitored process 157 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2023-11-29 05:59:30,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 [2023-11-29 05:59:30,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2023-11-29 05:59:30,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,361 INFO L229 MonitoredProcess]: Starting monitored process 158 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2023-11-29 05:59:30,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:30,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:30,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2023-11-29 05:59:30,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,382 INFO L229 MonitoredProcess]: Starting monitored process 159 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2023-11-29 05:59:30,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:30,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:30,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2023-11-29 05:59:30,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,401 INFO L229 MonitoredProcess]: Starting monitored process 160 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2023-11-29 05:59:30,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2023-11-29 05:59:30,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,419 INFO L229 MonitoredProcess]: Starting monitored process 161 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2023-11-29 05:59:30,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2023-11-29 05:59:30,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,436 INFO L229 MonitoredProcess]: Starting monitored process 162 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2023-11-29 05:59:30,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:30,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:30,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2023-11-29 05:59:30,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,456 INFO L229 MonitoredProcess]: Starting monitored process 163 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2023-11-29 05:59:30,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:30,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:30,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2023-11-29 05:59:30,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,475 INFO L229 MonitoredProcess]: Starting monitored process 164 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2023-11-29 05:59:30,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:30,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:30,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2023-11-29 05:59:30,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,497 INFO L229 MonitoredProcess]: Starting monitored process 165 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2023-11-29 05:59:30,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:59:30,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:59:30,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:59:30,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2023-11-29 05:59:30,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,516 INFO L229 MonitoredProcess]: Starting monitored process 166 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2023-11-29 05:59:30,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 [2023-11-29 05:59:30,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,528 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2023-11-29 05:59:30,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,537 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2023-11-29 05:59:30,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:30,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2023-11-29 05:59:30,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,560 INFO L229 MonitoredProcess]: Starting monitored process 167 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2023-11-29 05:59:30,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 [2023-11-29 05:59:30,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:30,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:30,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:59:30,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2023-11-29 05:59:30,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,581 INFO L229 MonitoredProcess]: Starting monitored process 168 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2023-11-29 05:59:30,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 05:59:30,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:59:30,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:59:30,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:59:30,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:59:30,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:59:30,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:59:30,612 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 05:59:30,639 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-11-29 05:59:30,639 INFO L444 ModelExtractionUtils]: 0 out of 25 variables were initially zero. Simplification set additionally 22 variables to zero. [2023-11-29 05:59:30,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:59:30,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:30,641 INFO L229 MonitoredProcess]: Starting monitored process 169 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:30,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2023-11-29 05:59:30,642 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 05:59:30,653 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 05:59:30,653 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 05:59:30,653 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, merge_sort_merge_~n#1) = -1*merge_sort_merge_~i~0#1 + 1*merge_sort_merge_~n#1 Supporting invariants [] [2023-11-29 05:59:30,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2023-11-29 05:59:30,685 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2023-11-29 05:59:30,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:30,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 05:59:30,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:31,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:59:31,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:59:31,068 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-11-29 05:59:31,068 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 624 states and 788 transitions. cyclomatic complexity: 189 Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:59:31,105 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 624 states and 788 transitions. cyclomatic complexity: 189. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 642 states and 806 transitions. Complement of second has 7 states. [2023-11-29 05:59:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-29 05:59:31,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:59:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2023-11-29 05:59:31,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 91 letters. Loop has 2 letters. [2023-11-29 05:59:31,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:59:31,106 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 05:59:31,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:31,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 05:59:31,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:31,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2023-11-29 05:59:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:31,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:59:31,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:59:31,568 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2023-11-29 05:59:31,569 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 624 states and 788 transitions. cyclomatic complexity: 189 Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:59:31,616 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 624 states and 788 transitions. cyclomatic complexity: 189. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 642 states and 806 transitions. Complement of second has 7 states. [2023-11-29 05:59:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-29 05:59:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:59:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2023-11-29 05:59:31,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 91 letters. Loop has 2 letters. [2023-11-29 05:59:31,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:59:31,618 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 05:59:31,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:31,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 05:59:31,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:32,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:59:32,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:59:32,037 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-11-29 05:59:32,038 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 624 states and 788 transitions. cyclomatic complexity: 189 Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:59:32,073 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 624 states and 788 transitions. cyclomatic complexity: 189. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 658 states and 824 transitions. Complement of second has 6 states. [2023-11-29 05:59:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-29 05:59:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:59:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2023-11-29 05:59:32,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 91 letters. Loop has 2 letters. [2023-11-29 05:59:32,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:59:32,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 93 letters. Loop has 2 letters. [2023-11-29 05:59:32,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:59:32,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 91 letters. Loop has 4 letters. [2023-11-29 05:59:32,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:59:32,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 824 transitions. [2023-11-29 05:59:32,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 05:59:32,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 452 states and 564 transitions. [2023-11-29 05:59:32,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2023-11-29 05:59:32,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2023-11-29 05:59:32,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 452 states and 564 transitions. [2023-11-29 05:59:32,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:59:32,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 452 states and 564 transitions. [2023-11-29 05:59:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states and 564 transitions. [2023-11-29 05:59:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 443. [2023-11-29 05:59:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 414 states have (on average 1.2053140096618358) internal successors, (499), 414 states have internal predecessors, (499), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (35), 17 states have call predecessors, (35), 17 states have call successors, (35) [2023-11-29 05:59:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 554 transitions. [2023-11-29 05:59:32,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 443 states and 554 transitions. [2023-11-29 05:59:32,096 INFO L428 stractBuchiCegarLoop]: Abstraction has 443 states and 554 transitions. [2023-11-29 05:59:32,097 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2023-11-29 05:59:32,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 443 states and 554 transitions. [2023-11-29 05:59:32,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 05:59:32,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:59:32,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:59:32,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 05:59:32,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 05:59:32,100 INFO L748 eck$LassoCheckResult]: Stem: 33464#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33411#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 33412#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; 33415#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 33416#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 33417#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 33418#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 33475#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 33474#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 33473#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 33472#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 33471#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 33470#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 33469#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 33468#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 33467#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 33459#L40-4 havoc main_~i~1#1; 33387#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 33388#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33509#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); 33425#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 33430#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33524#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); 33395#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 33436#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33438#L24 assume ~n#1 < 2; 33525#merge_sortFINAL assume true; 33523#merge_sortEXIT >#88#return; 33390#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 33522#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33521#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); 33515#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 33518#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33526#L24 assume ~n#1 < 2; 33527#merge_sortFINAL assume true; 33514#merge_sortEXIT >#88#return; 33516#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 33518#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33526#L24 assume ~n#1 < 2; 33527#merge_sortFINAL assume true; 33514#merge_sortEXIT >#90#return; 33517#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 33563#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 33562#L12 assume !(merge_~j~0#1 == merge_~n#1); 33505#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 33500#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 33501#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 33506#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 33502#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 33497#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 33491#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 33492#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 33465#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 33466#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 33547#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 33546#L11-4 merge_~i~0#1 := 0; 33545#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 33544#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 33541#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 33540#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 33538#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 33536#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 33534#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 33532#merge_sortFINAL assume true; 33528#merge_sortEXIT >#90#return; 33530#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 33658#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 33657#L12 assume !(merge_~j~0#1 == merge_~n#1); 33656#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 33654#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 33653#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 33652#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 33651#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 33650#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 33649#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 33648#L12 assume !(merge_~j~0#1 == merge_~n#1); 33647#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 33645#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 33644#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 33643#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 33642#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 33641#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 33640#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 33633#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 33634#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 33659#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 33638#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 33577#L11-4 merge_~i~0#1 := 0; 33576#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 33575#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 33543#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 33542#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 33539#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 33537#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 33535#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 33533#merge_sortFINAL assume true; 33424#merge_sortEXIT >#88#return; 33426#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 33565#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33560#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); 33400#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 33429#$Ultimate##0 [2023-11-29 05:59:32,100 INFO L750 eck$LassoCheckResult]: Loop: 33429#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33572#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); 33394#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 33429#$Ultimate##0 [2023-11-29 05:59:32,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:32,100 INFO L85 PathProgramCache]: Analyzing trace with hash -861392458, now seen corresponding path program 13 times [2023-11-29 05:59:32,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:59:32,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025303239] [2023-11-29 05:59:32,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:32,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:59:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:59:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:32,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:59:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:32,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:59:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:32,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:59:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:32,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:59:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 55 proven. 68 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-29 05:59:32,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:59:32,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025303239] [2023-11-29 05:59:32,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025303239] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:59:32,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110673789] [2023-11-29 05:59:32,790 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 05:59:32,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:59:32,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:32,791 INFO L229 MonitoredProcess]: Starting monitored process 170 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:59:32,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2023-11-29 05:59:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:33,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:59:33,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 89 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-11-29 05:59:33,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:59:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 89 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-11-29 05:59:33,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110673789] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:59:33,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:59:33,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 22 [2023-11-29 05:59:33,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687097592] [2023-11-29 05:59:33,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:59:33,281 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:59:33,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 6 times [2023-11-29 05:59:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:59:33,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469504856] [2023-11-29 05:59:33,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:33,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:59:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:59:33,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:59:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:59:33,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:59:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:59:33,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 05:59:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2023-11-29 05:59:33,441 INFO L87 Difference]: Start difference. First operand 443 states and 554 transitions. cyclomatic complexity: 128 Second operand has 22 states, 21 states have (on average 5.285714285714286) internal successors, (111), 20 states have internal predecessors, (111), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:59:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:59:34,475 INFO L93 Difference]: Finished difference Result 1203 states and 1531 transitions. [2023-11-29 05:59:34,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1203 states and 1531 transitions. [2023-11-29 05:59:34,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 05:59:34,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1203 states to 1188 states and 1516 transitions. [2023-11-29 05:59:34,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 340 [2023-11-29 05:59:34,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 340 [2023-11-29 05:59:34,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1188 states and 1516 transitions. [2023-11-29 05:59:34,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:59:34,489 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1188 states and 1516 transitions. [2023-11-29 05:59:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states and 1516 transitions. [2023-11-29 05:59:34,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 523. [2023-11-29 05:59:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 494 states have (on average 1.2125506072874495) internal successors, (599), 494 states have internal predecessors, (599), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (35), 17 states have call predecessors, (35), 17 states have call successors, (35) [2023-11-29 05:59:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 654 transitions. [2023-11-29 05:59:34,502 INFO L240 hiAutomatonCegarLoop]: Abstraction has 523 states and 654 transitions. [2023-11-29 05:59:34,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-29 05:59:34,503 INFO L428 stractBuchiCegarLoop]: Abstraction has 523 states and 654 transitions. [2023-11-29 05:59:34,503 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2023-11-29 05:59:34,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 523 states and 654 transitions. [2023-11-29 05:59:34,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 05:59:34,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:59:34,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:59:34,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 05:59:34,505 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 05:59:34,506 INFO L748 eck$LassoCheckResult]: Stem: 35932#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35879#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 35880#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; 35882#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 35883#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 35884#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 35885#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 35886#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 35940#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 35939#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 35938#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 35937#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 35936#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 35935#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 35934#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 35933#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 35929#L40-4 havoc main_~i~1#1; 35857#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 35858#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35941#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); 35888#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35907#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35908#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); 35894#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35901#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35952#L24 assume ~n#1 < 2; 35953#merge_sortFINAL assume true; 35896#merge_sortEXIT >#88#return; 35861#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35966#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35965#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); 35904#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35903#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35906#L24 assume ~n#1 < 2; 35964#merge_sortFINAL assume true; 35950#merge_sortEXIT >#88#return; 35905#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35903#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35906#L24 assume ~n#1 < 2; 35964#merge_sortFINAL assume true; 35950#merge_sortEXIT >#90#return; 35951#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 36144#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 36143#L12 assume !(merge_~j~0#1 == merge_~n#1); 36142#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 36140#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 36139#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 36138#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 36137#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 36136#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 36135#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 36133#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 36131#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 36130#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 36129#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 36128#L11-4 merge_~i~0#1 := 0; 35918#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 35915#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 35916#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 35919#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 36104#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 35873#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 35874#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 35881#merge_sortFINAL assume true; 35944#merge_sortEXIT >#90#return; 35945#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 36256#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35887#L12 assume !(merge_~j~0#1 == merge_~n#1); 35889#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 36314#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 36315#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 36323#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 36322#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 36321#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 36320#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 36319#L12 assume !(merge_~j~0#1 == merge_~n#1); 36317#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 36318#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 36334#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 36333#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 36332#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 36331#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 36330#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 36324#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 36325#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 36358#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 36357#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 35990#L11-4 merge_~i~0#1 := 0; 35989#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 35988#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 35987#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 35986#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 35979#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 35978#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 35977#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 35976#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 35954#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 35948#merge_sortFINAL assume true; 35949#merge_sortEXIT >#88#return; 35899#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35963#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35942#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); 35866#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35900#$Ultimate##0 [2023-11-29 05:59:34,506 INFO L750 eck$LassoCheckResult]: Loop: 35900#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35946#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); 35869#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35900#$Ultimate##0 [2023-11-29 05:59:34,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:34,506 INFO L85 PathProgramCache]: Analyzing trace with hash 948403828, now seen corresponding path program 14 times [2023-11-29 05:59:34,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:59:34,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860695442] [2023-11-29 05:59:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:34,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:59:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:59:34,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:59:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:59:34,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:59:34,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 7 times [2023-11-29 05:59:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:59:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580794931] [2023-11-29 05:59:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:34,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:59:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:59:34,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:59:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:59:34,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:59:34,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:34,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1603567071, now seen corresponding path program 15 times [2023-11-29 05:59:34,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:59:34,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349145499] [2023-11-29 05:59:34,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:34,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:59:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:35,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:59:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:35,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:59:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:35,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:59:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:35,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:59:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:35,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:59:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 24 proven. 59 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-11-29 05:59:35,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:59:35,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349145499] [2023-11-29 05:59:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349145499] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:59:35,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098754105] [2023-11-29 05:59:35,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:59:35,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:59:35,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:35,313 INFO L229 MonitoredProcess]: Starting monitored process 171 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:59:35,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Waiting until timeout for monitored process [2023-11-29 05:59:35,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-29 05:59:35,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:59:35,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 05:59:35,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 34 proven. 49 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-11-29 05:59:35,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:59:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 34 proven. 49 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-11-29 05:59:35,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098754105] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:59:35,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:59:35,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 22 [2023-11-29 05:59:35,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38473865] [2023-11-29 05:59:35,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:59:35,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:59:35,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 05:59:35,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-11-29 05:59:35,959 INFO L87 Difference]: Start difference. First operand 523 states and 654 transitions. cyclomatic complexity: 148 Second operand has 22 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 7 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 05:59:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:59:36,348 INFO L93 Difference]: Finished difference Result 716 states and 882 transitions. [2023-11-29 05:59:36,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 716 states and 882 transitions. [2023-11-29 05:59:36,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 05:59:36,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 716 states to 526 states and 657 transitions. [2023-11-29 05:59:36,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 146 [2023-11-29 05:59:36,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 146 [2023-11-29 05:59:36,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 526 states and 657 transitions. [2023-11-29 05:59:36,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 05:59:36,356 INFO L218 hiAutomatonCegarLoop]: Abstraction has 526 states and 657 transitions. [2023-11-29 05:59:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states and 657 transitions. [2023-11-29 05:59:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 525. [2023-11-29 05:59:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 496 states have (on average 1.2116935483870968) internal successors, (601), 496 states have internal predecessors, (601), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (35), 17 states have call predecessors, (35), 17 states have call successors, (35) [2023-11-29 05:59:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 656 transitions. [2023-11-29 05:59:36,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 525 states and 656 transitions. [2023-11-29 05:59:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:59:36,365 INFO L428 stractBuchiCegarLoop]: Abstraction has 525 states and 656 transitions. [2023-11-29 05:59:36,365 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2023-11-29 05:59:36,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 525 states and 656 transitions. [2023-11-29 05:59:36,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 05:59:36,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:59:36,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:59:36,368 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 05:59:36,368 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 05:59:36,369 INFO L748 eck$LassoCheckResult]: Stem: 37979#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37928#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 37929#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; 37932#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 37933#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 37934#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 37935#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 37994#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 37993#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 37992#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 37991#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 37990#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 37989#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 37988#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 37987#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 37986#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 37985#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 37984#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 37978#L40-4 havoc main_~i~1#1; 37906#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 37907#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37972#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); 37943#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37958#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37959#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); 37909#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37952#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38048#L24 assume ~n#1 < 2; 38049#merge_sortFINAL assume true; 38046#merge_sortEXIT >#88#return; 38005#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 38045#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38044#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); 38039#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 38041#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38050#L24 assume ~n#1 < 2; 38051#merge_sortFINAL assume true; 38037#merge_sortEXIT >#88#return; 38038#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 38041#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38050#L24 assume ~n#1 < 2; 38051#merge_sortFINAL assume true; 38037#merge_sortEXIT >#90#return; 38040#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 38122#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38121#L12 assume !(merge_~j~0#1 == merge_~n#1); 38106#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 38103#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 38104#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 38114#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 38112#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 38110#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 38108#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38074#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 38072#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 38070#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 38068#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 38066#L11-4 merge_~i~0#1 := 0; 38064#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 38062#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 38061#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 38060#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 38059#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 38058#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 38057#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 38056#merge_sortFINAL assume true; 38052#merge_sortEXIT >#90#return; 38053#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 38262#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38261#L12 assume !(merge_~j~0#1 == merge_~n#1); 38260#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 38258#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 38257#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 38256#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 38255#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 38254#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 38253#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38252#L12 assume !(merge_~j~0#1 == merge_~n#1); 38251#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 38249#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 38248#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 38247#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 38246#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 38245#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 38244#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38237#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 38238#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 38263#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 38242#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 38127#L11-4 merge_~i~0#1 := 0; 38126#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 38125#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 38124#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 38118#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 38117#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 38116#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 38115#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 38113#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 38097#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 38095#merge_sortFINAL assume true; 37942#merge_sortEXIT >#88#return; 37944#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 38133#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38132#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); 37917#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 38131#$Ultimate##0 [2023-11-29 05:59:36,369 INFO L750 eck$LassoCheckResult]: Loop: 38131#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38137#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); 37910#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 38131#$Ultimate##0 [2023-11-29 05:59:36,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:36,369 INFO L85 PathProgramCache]: Analyzing trace with hash -697559338, now seen corresponding path program 16 times [2023-11-29 05:59:36,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:59:36,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625528669] [2023-11-29 05:59:36,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:36,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:59:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:59:36,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:59:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:59:36,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:59:36,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:36,494 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 8 times [2023-11-29 05:59:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:59:36,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110762099] [2023-11-29 05:59:36,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:36,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:59:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:59:36,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:59:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:59:36,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:59:36,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:36,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1938460099, now seen corresponding path program 17 times [2023-11-29 05:59:36,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:59:36,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991579924] [2023-11-29 05:59:36,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:36,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:59:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:59:36,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:59:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:59:36,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:59:54,298 WARN L293 SmtUtils]: Spent 15.09s on a formula simplification. DAG size of input: 379 DAG size of output: 312 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 06:00:19,892 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 06:00:19,892 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 06:00:19,892 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 06:00:19,892 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 06:00:19,892 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 06:00:19,892 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:19,892 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 06:00:19,892 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 06:00:19,892 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration27_Lasso [2023-11-29 06:00:19,892 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 06:00:19,892 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 06:00:19,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:19,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:00:20,827 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 06:00:20,827 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 06:00:20,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:20,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:20,829 INFO L229 MonitoredProcess]: Starting monitored process 172 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:20,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2023-11-29 06:00:20,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:00:20,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:20,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:00:20,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:20,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:20,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:20,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:00:20,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:00:20,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:00:20,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2023-11-29 06:00:20,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:20,846 INFO L229 MonitoredProcess]: Starting monitored process 173 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:20,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2023-11-29 06:00:20,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:00:20,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:20,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:00:20,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:20,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:20,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:20,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:00:20,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:00:20,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:00:20,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2023-11-29 06:00:20,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:20,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:20,863 INFO L229 MonitoredProcess]: Starting monitored process 174 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:20,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2023-11-29 06:00:20,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:00:20,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:20,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:00:20,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:20,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:20,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:20,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:00:20,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:00:20,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:00:20,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2023-11-29 06:00:20,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:20,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:20,883 INFO L229 MonitoredProcess]: Starting monitored process 175 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:20,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2023-11-29 06:00:20,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:00:20,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:20,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:00:20,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:20,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:20,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:20,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:00:20,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:00:20,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:00:20,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2023-11-29 06:00:20,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:20,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:20,901 INFO L229 MonitoredProcess]: Starting monitored process 176 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:20,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2023-11-29 06:00:20,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:00:20,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:20,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:00:20,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:20,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:20,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:20,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:00:20,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:00:20,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:00:20,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2023-11-29 06:00:20,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:20,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:20,918 INFO L229 MonitoredProcess]: Starting monitored process 177 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:20,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2023-11-29 06:00:20,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:00:20,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:20,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:00:20,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:20,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:20,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:20,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:00:20,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:00:20,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:00:20,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2023-11-29 06:00:20,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:20,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:20,938 INFO L229 MonitoredProcess]: Starting monitored process 178 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:20,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2023-11-29 06:00:20,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:00:20,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:20,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:00:20,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:20,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:20,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:20,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:00:20,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:00:20,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:00:20,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2023-11-29 06:00:20,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:20,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:20,957 INFO L229 MonitoredProcess]: Starting monitored process 179 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:20,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2023-11-29 06:00:20,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 [2023-11-29 06:00:20,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:20,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:00:20,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:20,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:20,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:20,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:00:20,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:00:20,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:00:20,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2023-11-29 06:00:20,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:20,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:20,974 INFO L229 MonitoredProcess]: Starting monitored process 180 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:20,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2023-11-29 06:00:20,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:00:20,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:20,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:00:20,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:20,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:20,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:20,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:00:20,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:00:20,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:00:20,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2023-11-29 06:00:20,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:20,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:20,992 INFO L229 MonitoredProcess]: Starting monitored process 181 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:20,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2023-11-29 06:00:20,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:00:21,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:21,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:00:21,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:21,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:21,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:21,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:00:21,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:00:21,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:00:21,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2023-11-29 06:00:21,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:21,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:21,009 INFO L229 MonitoredProcess]: Starting monitored process 182 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:21,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2023-11-29 06:00:21,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:00:21,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:21,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:00:21,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:21,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:21,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:21,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:00:21,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:00:21,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:00:21,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2023-11-29 06:00:21,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:21,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:21,026 INFO L229 MonitoredProcess]: Starting monitored process 183 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:21,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2023-11-29 06:00:21,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:00:21,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:21,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:00:21,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:21,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:21,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:21,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:00:21,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:00:21,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:00:21,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2023-11-29 06:00:21,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:21,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:21,043 INFO L229 MonitoredProcess]: Starting monitored process 184 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:21,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2023-11-29 06:00:21,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:00:21,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:00:21,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:00:21,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:00:21,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:00:21,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:00:21,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:00:21,064 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 06:00:21,069 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-11-29 06:00:21,070 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-11-29 06:00:21,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:00:21,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:21,071 INFO L229 MonitoredProcess]: Starting monitored process 185 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:00:21,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2023-11-29 06:00:21,073 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 06:00:21,084 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 06:00:21,084 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 06:00:21,084 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1 Supporting invariants [] [2023-11-29 06:00:21,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2023-11-29 06:00:21,090 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-11-29 06:00:21,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:00:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:21,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 06:00:21,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:00:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:21,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:00:21,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:00:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:00:21,650 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-11-29 06:00:21,650 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 525 states and 656 transitions. cyclomatic complexity: 148 Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:00:21,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2023-11-29 06:00:21,718 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 525 states and 656 transitions. cyclomatic complexity: 148. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 532 states and 663 transitions. Complement of second has 13 states. [2023-11-29 06:00:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 06:00:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:00:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-11-29 06:00:21,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 105 letters. Loop has 3 letters. [2023-11-29 06:00:21,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:00:21,720 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 06:00:21,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:00:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:21,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 06:00:21,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:00:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:22,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:00:22,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:00:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:00:22,270 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2023-11-29 06:00:22,270 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 525 states and 656 transitions. cyclomatic complexity: 148 Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:00:22,320 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 525 states and 656 transitions. cyclomatic complexity: 148. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 532 states and 663 transitions. Complement of second has 13 states. [2023-11-29 06:00:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 06:00:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:00:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-11-29 06:00:22,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 105 letters. Loop has 3 letters. [2023-11-29 06:00:22,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:00:22,322 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 06:00:22,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:00:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:22,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 06:00:22,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:00:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:22,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:00:22,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:00:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:00:22,958 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-11-29 06:00:22,958 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 525 states and 656 transitions. cyclomatic complexity: 148 Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:00:23,026 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 525 states and 656 transitions. cyclomatic complexity: 148. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 564 states and 702 transitions. Complement of second has 16 states. [2023-11-29 06:00:23,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 06:00:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:00:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2023-11-29 06:00:23,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 105 letters. Loop has 3 letters. [2023-11-29 06:00:23,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:00:23,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 108 letters. Loop has 3 letters. [2023-11-29 06:00:23,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:00:23,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 105 letters. Loop has 6 letters. [2023-11-29 06:00:23,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:00:23,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 564 states and 702 transitions. [2023-11-29 06:00:23,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2023-11-29 06:00:23,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 564 states to 541 states and 678 transitions. [2023-11-29 06:00:23,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2023-11-29 06:00:23,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 157 [2023-11-29 06:00:23,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 541 states and 678 transitions. [2023-11-29 06:00:23,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 06:00:23,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 541 states and 678 transitions. [2023-11-29 06:00:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states and 678 transitions. [2023-11-29 06:00:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 538. [2023-11-29 06:00:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 505 states have (on average 1.2099009900990099) internal successors, (611), 506 states have internal predecessors, (611), 21 states have call successors, (21), 14 states have call predecessors, (21), 12 states have return successors, (39), 17 states have call predecessors, (39), 18 states have call successors, (39) [2023-11-29 06:00:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 671 transitions. [2023-11-29 06:00:23,054 INFO L240 hiAutomatonCegarLoop]: Abstraction has 538 states and 671 transitions. [2023-11-29 06:00:23,054 INFO L428 stractBuchiCegarLoop]: Abstraction has 538 states and 671 transitions. [2023-11-29 06:00:23,054 INFO L335 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2023-11-29 06:00:23,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 538 states and 671 transitions. [2023-11-29 06:00:23,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-29 06:00:23,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:00:23,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:00:23,058 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 06:00:23,058 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3] [2023-11-29 06:00:23,058 INFO L748 eck$LassoCheckResult]: Stem: 41191#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 41141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 41142#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; 41145#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 41146#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 41147#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 41148#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 41202#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 41201#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 41200#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 41199#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 41198#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 41197#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 41196#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 41195#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 41194#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 41193#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 41192#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 41187#L40-4 havoc main_~i~1#1; 41117#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 41118#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41265#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); 41124#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41159#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41262#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); 41120#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41254#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41261#L24 assume ~n#1 < 2; 41263#merge_sortFINAL assume true; 41252#merge_sortEXIT >#88#return; 41209#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41260#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41256#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); 41251#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41253#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41259#L24 assume ~n#1 < 2; 41255#merge_sortFINAL assume true; 41250#merge_sortEXIT >#88#return; 41246#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41248#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41266#L24 assume ~n#1 < 2; 41249#merge_sortFINAL assume true; 41245#merge_sortEXIT >#90#return; 41247#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 41241#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41242#L12 assume !(merge_~j~0#1 == merge_~n#1); 41326#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41321#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 41317#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41313#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 41304#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 41303#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 41296#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41291#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 41289#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 41287#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 41285#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 41283#L11-4 merge_~i~0#1 := 0; 41281#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 41279#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 41278#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 41277#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 41276#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 41275#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 41274#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 41273#merge_sortFINAL assume true; 41271#merge_sortEXIT >#90#return; 41152#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 41153#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41149#L12 assume !(merge_~j~0#1 == merge_~n#1); 41150#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41619#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 41618#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41617#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 41616#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 41615#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 41614#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41613#L12 assume !(merge_~j~0#1 == merge_~n#1); 41612#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41610#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 41609#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41608#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 41607#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 41606#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 41605#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41601#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 41602#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 41654#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 41653#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 41346#L11-4 merge_~i~0#1 := 0; 41345#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 41344#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 41343#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 41342#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 41341#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 41340#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 41339#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 41338#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 41336#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 41334#merge_sortFINAL assume true; 41331#merge_sortEXIT >#88#return; 41176#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41337#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41335#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); 41130#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41267#$Ultimate##0 [2023-11-29 06:00:23,059 INFO L750 eck$LassoCheckResult]: Loop: 41267#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41167#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); 41127#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41166#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41167#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); 41127#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41166#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41167#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); 41127#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41166#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41168#L24 assume ~n#1 < 2; 41156#merge_sortFINAL assume true; 41154#merge_sortEXIT >#88#return; 41155#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41387#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41392#L24 assume ~n#1 < 2; 41353#merge_sortFINAL assume true; 41269#merge_sortEXIT >#90#return; 41270#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 41421#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41420#L12 assume !(merge_~j~0#1 == merge_~n#1); 41419#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41417#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 41416#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41415#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 41414#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 41413#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 41412#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41408#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 41409#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 41402#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 41403#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 41364#L11-4 merge_~i~0#1 := 0; 41361#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 41359#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 41358#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 41357#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 41356#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 41355#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 41354#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 41348#merge_sortFINAL assume true; 41349#merge_sortEXIT >#88#return; 41132#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41352#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41391#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); 41389#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41158#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41268#L24 assume ~n#1 < 2; 41390#merge_sortFINAL assume true; 41388#merge_sortEXIT >#88#return; 41155#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41387#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41392#L24 assume ~n#1 < 2; 41353#merge_sortFINAL assume true; 41269#merge_sortEXIT >#90#return; 41270#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 41421#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41420#L12 assume !(merge_~j~0#1 == merge_~n#1); 41419#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41417#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 41416#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41415#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 41414#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 41413#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 41412#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41408#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 41409#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 41402#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 41403#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 41364#L11-4 merge_~i~0#1 := 0; 41361#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 41359#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 41358#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 41357#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 41356#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 41355#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 41354#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 41348#merge_sortFINAL assume true; 41349#merge_sortEXIT >#90#return; 41333#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 41169#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41170#L12 assume !(merge_~j~0#1 == merge_~n#1); 41550#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41548#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 41547#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41546#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 41545#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 41544#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 41543#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41542#L12 assume !(merge_~j~0#1 == merge_~n#1); 41541#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41539#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 41538#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41537#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 41536#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 41535#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 41534#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41530#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 41531#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 41551#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 41552#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 41394#L11-4 merge_~i~0#1 := 0; 41178#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 41179#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 41180#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 41181#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 41400#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 41401#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 41396#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 41397#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 41143#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 41144#merge_sortFINAL assume true; 41332#merge_sortEXIT >#88#return; 41128#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41177#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41386#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); 41133#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41267#$Ultimate##0 [2023-11-29 06:00:23,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:00:23,059 INFO L85 PathProgramCache]: Analyzing trace with hash -697559338, now seen corresponding path program 18 times [2023-11-29 06:00:23,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:00:23,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716729647] [2023-11-29 06:00:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:00:23,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:00:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:00:23,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:00:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:00:23,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:00:23,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:00:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash -597143236, now seen corresponding path program 1 times [2023-11-29 06:00:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:00:23,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950329404] [2023-11-29 06:00:23,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:00:23,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:00:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:24,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:24,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:24,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:00:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:24,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:00:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:24,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:24,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:00:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 104 proven. 112 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-29 06:00:24,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:00:24,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950329404] [2023-11-29 06:00:24,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950329404] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:00:24,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459985125] [2023-11-29 06:00:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:00:24,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:00:24,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:24,193 INFO L229 MonitoredProcess]: Starting monitored process 186 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:00:24,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (186)] Waiting until timeout for monitored process [2023-11-29 06:00:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:24,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 06:00:24,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:00:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 99 proven. 109 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-11-29 06:00:24,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:00:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 99 proven. 109 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-11-29 06:00:24,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459985125] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:00:24,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:00:24,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 20 [2023-11-29 06:00:24,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324223208] [2023-11-29 06:00:24,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:00:24,842 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:00:24,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:00:24,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 06:00:24,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-11-29 06:00:24,843 INFO L87 Difference]: Start difference. First operand 538 states and 671 transitions. cyclomatic complexity: 150 Second operand has 20 states, 18 states have (on average 5.166666666666667) internal successors, (93), 17 states have internal predecessors, (93), 6 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-29 06:00:25,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:00:25,218 INFO L93 Difference]: Finished difference Result 749 states and 920 transitions. [2023-11-29 06:00:25,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 749 states and 920 transitions. [2023-11-29 06:00:25,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-29 06:00:25,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 749 states to 749 states and 920 transitions. [2023-11-29 06:00:25,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2023-11-29 06:00:25,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2023-11-29 06:00:25,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 749 states and 920 transitions. [2023-11-29 06:00:25,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 06:00:25,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 749 states and 920 transitions. [2023-11-29 06:00:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states and 920 transitions. [2023-11-29 06:00:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 608. [2023-11-29 06:00:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 575 states have (on average 1.2017391304347826) internal successors, (691), 575 states have internal predecessors, (691), 21 states have call successors, (21), 14 states have call predecessors, (21), 12 states have return successors, (39), 18 states have call predecessors, (39), 18 states have call successors, (39) [2023-11-29 06:00:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 751 transitions. [2023-11-29 06:00:25,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 608 states and 751 transitions. [2023-11-29 06:00:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:00:25,238 INFO L428 stractBuchiCegarLoop]: Abstraction has 608 states and 751 transitions. [2023-11-29 06:00:25,238 INFO L335 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2023-11-29 06:00:25,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 608 states and 751 transitions. [2023-11-29 06:00:25,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-29 06:00:25,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:00:25,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:00:25,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 06:00:25,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 8, 8, 8, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3] [2023-11-29 06:00:25,242 INFO L748 eck$LassoCheckResult]: Stem: 43425#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 43375#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 43376#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; 43379#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 43380#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43381#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 43382#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43437#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 43436#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43435#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 43434#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43433#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 43432#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43431#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 43430#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43429#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 43428#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43427#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 43421#L40-4 havoc main_~i~1#1; 43350#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 43351#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43462#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); 43357#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43400#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43401#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); 43362#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43394#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43545#L24 assume ~n#1 < 2; 43550#merge_sortFINAL assume true; 43541#merge_sortEXIT >#88#return; 43354#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 43451#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43446#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); 43448#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43464#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43559#L24 assume ~n#1 < 2; 43557#merge_sortFINAL assume true; 43463#merge_sortEXIT >#88#return; 43398#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 43397#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43399#L24 assume ~n#1 < 2; 43583#merge_sortFINAL assume true; 43582#merge_sortEXIT >#90#return; 43581#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 43580#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43579#L12 assume !(merge_~j~0#1 == merge_~n#1); 43576#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 43577#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 43622#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 43624#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 43623#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43621#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43619#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43608#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 43607#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43606#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43605#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 43604#L11-4 merge_~i~0#1 := 0; 43603#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43601#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43595#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43594#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43591#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 43590#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 43587#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 43588#merge_sortFINAL assume true; 43388#merge_sortEXIT >#90#return; 43386#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 43387#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43383#L12 assume !(merge_~j~0#1 == merge_~n#1); 43384#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 43907#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 43919#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 43918#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 43917#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43916#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43915#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43914#L12 assume !(merge_~j~0#1 == merge_~n#1); 43879#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 43900#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 43897#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 43876#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 43875#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43874#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43872#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43869#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 43870#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43922#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43931#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 43586#L11-4 merge_~i~0#1 := 0; 43584#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43578#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43575#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43573#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43570#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43569#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43567#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 43565#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 43563#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 43562#merge_sortFINAL assume true; 43458#merge_sortEXIT >#88#return; 43441#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 43443#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43444#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); 43364#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43438#$Ultimate##0 [2023-11-29 06:00:25,256 INFO L750 eck$LassoCheckResult]: Loop: 43438#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43440#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); 43368#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43474#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43440#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); 43368#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43474#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43440#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); 43368#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43474#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43498#L24 assume ~n#1 < 2; 43478#merge_sortFINAL assume true; 43473#merge_sortEXIT >#88#return; 43410#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 43449#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43450#L24 assume ~n#1 < 2; 43416#merge_sortFINAL assume true; 43585#merge_sortEXIT >#90#return; 43654#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 43653#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43652#L12 assume !(merge_~j~0#1 == merge_~n#1); 43651#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 43649#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 43648#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 43647#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 43646#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43645#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43644#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43640#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 43638#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43639#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43684#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 43487#L11-4 merge_~i~0#1 := 0; 43485#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43481#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43480#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43479#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43476#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 43475#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 43470#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 43468#merge_sortFINAL assume true; 43467#merge_sortEXIT >#88#return; 43360#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 43466#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43465#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); 43392#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43393#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43439#L24 assume ~n#1 < 2; 43477#merge_sortFINAL assume true; 43471#merge_sortEXIT >#88#return; 43410#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 43449#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43450#L24 assume ~n#1 < 2; 43416#merge_sortFINAL assume true; 43585#merge_sortEXIT >#90#return; 43654#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 43653#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43652#L12 assume !(merge_~j~0#1 == merge_~n#1); 43651#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 43649#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 43648#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 43647#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 43646#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43645#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43644#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43640#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 43638#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43639#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43684#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 43487#L11-4 merge_~i~0#1 := 0; 43485#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43481#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43480#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43479#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43476#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 43475#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 43470#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 43468#merge_sortFINAL assume true; 43467#merge_sortEXIT >#90#return; 43461#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 43798#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43797#L12 assume !(merge_~j~0#1 == merge_~n#1); 43796#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 43794#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 43793#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 43792#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 43791#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43790#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43789#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43788#L12 assume !(merge_~j~0#1 == merge_~n#1); 43787#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 43785#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 43784#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 43783#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 43782#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43781#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43780#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43776#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 43777#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43866#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43769#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43770#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 43766#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43774#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43771#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 43634#L11-4 merge_~i~0#1 := 0; 43627#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43628#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43413#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43414#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43599#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43600#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43592#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 43593#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 43377#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 43378#merge_sortFINAL assume true; 43459#merge_sortEXIT >#88#return; 43367#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 43469#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43442#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); 43361#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43438#$Ultimate##0 [2023-11-29 06:00:25,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:00:25,257 INFO L85 PathProgramCache]: Analyzing trace with hash -697559338, now seen corresponding path program 19 times [2023-11-29 06:00:25,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:00:25,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502685462] [2023-11-29 06:00:25,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:00:25,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:00:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:00:25,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:00:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:00:25,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:00:25,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:00:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash 3791671, now seen corresponding path program 2 times [2023-11-29 06:00:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:00:25,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831209526] [2023-11-29 06:00:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:00:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:00:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:25,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:25,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:25,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:25,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:00:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:25,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:00:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:25,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:25,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:00:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 184 proven. 38 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-29 06:00:25,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:00:25,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831209526] [2023-11-29 06:00:25,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831209526] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:00:25,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178585992] [2023-11-29 06:00:25,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:00:25,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:00:25,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:25,969 INFO L229 MonitoredProcess]: Starting monitored process 187 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:00:25,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Waiting until timeout for monitored process [2023-11-29 06:00:26,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:00:26,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:00:26,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 06:00:26,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:00:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 61 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-11-29 06:00:26,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:00:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 61 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-11-29 06:00:26,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178585992] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:00:26,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:00:26,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2023-11-29 06:00:26,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468418443] [2023-11-29 06:00:26,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:00:26,813 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:00:26,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:00:26,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 06:00:26,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2023-11-29 06:00:26,814 INFO L87 Difference]: Start difference. First operand 608 states and 751 transitions. cyclomatic complexity: 160 Second operand has 23 states, 21 states have (on average 4.857142857142857) internal successors, (102), 20 states have internal predecessors, (102), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 06:00:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:00:28,260 INFO L93 Difference]: Finished difference Result 1140 states and 1420 transitions. [2023-11-29 06:00:28,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1140 states and 1420 transitions. [2023-11-29 06:00:28,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-29 06:00:28,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1140 states to 1134 states and 1414 transitions. [2023-11-29 06:00:28,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2023-11-29 06:00:28,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2023-11-29 06:00:28,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1134 states and 1414 transitions. [2023-11-29 06:00:28,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 06:00:28,272 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1134 states and 1414 transitions. [2023-11-29 06:00:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states and 1414 transitions. [2023-11-29 06:00:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 810. [2023-11-29 06:00:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 777 states have (on average 1.2175032175032174) internal successors, (946), 777 states have internal predecessors, (946), 21 states have call successors, (21), 14 states have call predecessors, (21), 12 states have return successors, (39), 18 states have call predecessors, (39), 18 states have call successors, (39) [2023-11-29 06:00:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1006 transitions. [2023-11-29 06:00:28,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 810 states and 1006 transitions. [2023-11-29 06:00:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-29 06:00:28,318 INFO L428 stractBuchiCegarLoop]: Abstraction has 810 states and 1006 transitions. [2023-11-29 06:00:28,318 INFO L335 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2023-11-29 06:00:28,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 810 states and 1006 transitions. [2023-11-29 06:00:28,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-29 06:00:28,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:00:28,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:00:28,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 06:00:28,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2] [2023-11-29 06:00:28,323 INFO L748 eck$LassoCheckResult]: Stem: 46198#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 46150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 46151#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; 46156#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 46157#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 46158#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 46159#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 46210#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 46209#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 46208#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 46207#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 46206#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 46205#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 46204#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 46203#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 46202#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 46201#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 46200#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 46195#L40-4 havoc main_~i~1#1; 46126#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 46127#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46224#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); 46133#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 46177#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46178#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); 46129#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 46173#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46247#L24 assume ~n#1 < 2; 46246#merge_sortFINAL assume true; 46245#merge_sortEXIT >#88#return; 46153#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 46220#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46218#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); 46171#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 46172#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46176#L24 assume ~n#1 < 2; 46309#merge_sortFINAL assume true; 46307#merge_sortEXIT >#88#return; 46304#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 46305#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46308#L24 assume ~n#1 < 2; 46306#merge_sortFINAL assume true; 46303#merge_sortEXIT >#90#return; 46302#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 46301#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46300#L12 assume !(merge_~j~0#1 == merge_~n#1); 46299#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 46296#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 46294#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 46292#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 46290#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46287#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 46283#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46278#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 46277#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46276#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 46275#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 46274#L11-4 merge_~i~0#1 := 0; 46273#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 46263#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 46257#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 46256#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 46252#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 46249#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 46152#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 46155#merge_sortFINAL assume true; 46165#merge_sortEXIT >#90#return; 46167#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 46594#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46593#L12 assume !(merge_~j~0#1 == merge_~n#1); 46592#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 46590#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 46589#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 46588#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 46587#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46586#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 46585#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46584#L12 assume !(merge_~j~0#1 == merge_~n#1); 46583#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 46581#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 46580#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 46579#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 46578#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46577#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 46576#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46572#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 46573#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46887#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 46888#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 46563#L11-4 merge_~i~0#1 := 0; 46562#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 46182#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 46183#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 46184#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 46185#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 46258#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 46253#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 46250#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 46229#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 46225#merge_sortFINAL assume true; 46221#merge_sortEXIT >#88#return; 46214#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 46216#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46217#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); 46143#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 46211#$Ultimate##0 [2023-11-29 06:00:28,323 INFO L750 eck$LassoCheckResult]: Loop: 46211#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46212#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); 46137#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 46238#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46212#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); 46137#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 46238#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46244#L24 assume ~n#1 < 2; 46243#merge_sortFINAL assume true; 46237#merge_sortEXIT >#88#return; 46141#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 46233#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46242#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); 46236#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 46239#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46213#L24 assume ~n#1 < 2; 46241#merge_sortFINAL assume true; 46234#merge_sortEXIT >#88#return; 46169#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 46186#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46189#L24 assume ~n#1 < 2; 46168#merge_sortFINAL assume true; 46170#merge_sortEXIT >#90#return; 46480#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 46479#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46478#L12 assume !(merge_~j~0#1 == merge_~n#1); 46477#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 46475#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 46474#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 46473#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 46472#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46471#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 46470#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46466#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 46467#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46270#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 46271#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 46267#L11-4 merge_~i~0#1 := 0; 46266#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 46265#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 46262#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 46261#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 46255#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 46135#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 46145#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 46232#merge_sortFINAL assume true; 46231#merge_sortEXIT >#90#return; 46166#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 46648#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46647#L12 assume !(merge_~j~0#1 == merge_~n#1); 46646#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 46644#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 46643#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 46642#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 46641#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46640#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 46639#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46638#L12 assume !(merge_~j~0#1 == merge_~n#1); 46637#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 46635#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 46634#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 46633#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 46632#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46631#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 46630#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46626#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 46627#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46684#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 46655#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 46550#L11-4 merge_~i~0#1 := 0; 46548#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 46546#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 46537#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 46536#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 46535#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 46534#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 46533#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 46532#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 46531#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 46530#merge_sortFINAL assume true; 46529#merge_sortEXIT >#88#return; 46138#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 46227#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46215#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); 46139#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 46211#$Ultimate##0 [2023-11-29 06:00:28,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:00:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash -697559338, now seen corresponding path program 20 times [2023-11-29 06:00:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:00:28,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006209588] [2023-11-29 06:00:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:00:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:00:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:00:28,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:00:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:00:28,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:00:28,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:00:28,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1069641018, now seen corresponding path program 3 times [2023-11-29 06:00:28,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:00:28,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445162868] [2023-11-29 06:00:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:00:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:00:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:00:28,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:00:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:00:28,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:00:28,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:00:28,580 INFO L85 PathProgramCache]: Analyzing trace with hash 263947653, now seen corresponding path program 21 times [2023-11-29 06:00:28,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:00:28,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597887459] [2023-11-29 06:00:28,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:00:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:00:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:29,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 06:00:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:30,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:30,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:00:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:30,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:00:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:00:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:30,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:30,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:00:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:30,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:30,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:00:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 174 proven. 374 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2023-11-29 06:00:30,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:00:30,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597887459] [2023-11-29 06:00:30,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597887459] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:00:30,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448697831] [2023-11-29 06:00:30,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:00:30,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:00:30,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:30,729 INFO L229 MonitoredProcess]: Starting monitored process 188 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:00:30,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (188)] Waiting until timeout for monitored process [2023-11-29 06:00:31,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-11-29 06:00:31,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:00:31,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 06:00:31,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:00:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 302 proven. 111 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2023-11-29 06:00:31,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:00:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 304 proven. 109 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2023-11-29 06:00:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448697831] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:00:32,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:00:32,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 24] total 54 [2023-11-29 06:00:32,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069602676] [2023-11-29 06:00:32,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:00:44,213 WARN L293 SmtUtils]: Spent 9.81s on a formula simplification. DAG size of input: 369 DAG size of output: 292 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 06:00:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:00:49,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-29 06:00:49,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2547, Unknown=0, NotChecked=0, Total=2862 [2023-11-29 06:00:49,707 INFO L87 Difference]: Start difference. First operand 810 states and 1006 transitions. cyclomatic complexity: 213 Second operand has 54 states, 45 states have (on average 3.1777777777777776) internal successors, (143), 43 states have internal predecessors, (143), 18 states have call successors, (27), 10 states have call predecessors, (27), 3 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2023-11-29 06:00:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:00:52,350 INFO L93 Difference]: Finished difference Result 2163 states and 2659 transitions. [2023-11-29 06:00:52,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2163 states and 2659 transitions. [2023-11-29 06:00:52,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-29 06:00:52,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2163 states to 1752 states and 2149 transitions. [2023-11-29 06:00:52,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 291 [2023-11-29 06:00:52,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 296 [2023-11-29 06:00:52,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1752 states and 2149 transitions. [2023-11-29 06:00:52,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 06:00:52,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1752 states and 2149 transitions. [2023-11-29 06:00:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states and 2149 transitions. [2023-11-29 06:00:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1133. [2023-11-29 06:00:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1090 states have (on average 1.201834862385321) internal successors, (1310), 1089 states have internal predecessors, (1310), 28 states have call successors, (28), 20 states have call predecessors, (28), 15 states have return successors, (73), 23 states have call predecessors, (73), 25 states have call successors, (73) [2023-11-29 06:00:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1411 transitions. [2023-11-29 06:00:52,408 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1133 states and 1411 transitions. [2023-11-29 06:00:52,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-11-29 06:00:52,409 INFO L428 stractBuchiCegarLoop]: Abstraction has 1133 states and 1411 transitions. [2023-11-29 06:00:52,409 INFO L335 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2023-11-29 06:00:52,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1133 states and 1411 transitions. [2023-11-29 06:00:52,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-29 06:00:52,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:00:52,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:00:52,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 16, 16, 16, 15, 15, 14, 11, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2023-11-29 06:00:52,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 18, 18, 18, 12, 11, 10, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5] [2023-11-29 06:00:52,419 INFO L748 eck$LassoCheckResult]: Stem: 50748#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 50699#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 50700#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; 50702#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50703#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50704#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50705#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50706#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50776#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50775#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50774#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50773#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50772#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50771#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50770#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50769#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50768#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50767#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50766#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50765#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50764#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50763#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50762#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50761#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50760#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50759#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50758#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50757#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50756#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50755#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50754#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50753#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50752#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50751#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 50743#L40-4 havoc main_~i~1#1; 50677#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 50678#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50786#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); 50683#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50785#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50818#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); 50690#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50718#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50727#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); 50693#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50718#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50727#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); 50693#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50718#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50727#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); 50693#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50718#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50726#L24 assume ~n#1 < 2; 50937#merge_sortFINAL assume true; 50921#merge_sortEXIT >#88#return; 50680#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 50919#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50932#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); 50716#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50717#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51044#L24 assume ~n#1 < 2; 51043#merge_sortFINAL assume true; 51042#merge_sortEXIT >#88#return; 50733#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 50734#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50736#L24 assume ~n#1 < 2; 50737#merge_sortFINAL assume true; 51141#merge_sortEXIT >#90#return; 51140#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51139#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51137#L12 assume !(merge_~j~0#1 == merge_~n#1); 51134#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51131#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51129#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51127#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51125#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51121#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51117#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51111#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51109#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51107#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51104#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 51102#L11-4 merge_~i~0#1 := 0; 51100#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 51099#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 51098#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 51097#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 51096#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 51095#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 51094#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51093#merge_sortFINAL assume true; 50712#merge_sortEXIT >#90#return; 50713#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51204#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51203#L12 assume !(merge_~j~0#1 == merge_~n#1); 51202#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51200#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51199#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51198#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51197#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51196#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51195#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51194#L12 assume !(merge_~j~0#1 == merge_~n#1); 51193#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51191#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51190#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51189#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51188#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51187#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51186#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51182#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51183#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51243#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51239#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 50840#L11-4 merge_~i~0#1 := 0; 50835#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50831#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50829#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50826#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50823#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50822#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50819#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 50814#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 50807#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 50804#merge_sortFINAL assume true; 50798#merge_sortEXIT >#88#return; 50792#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 50795#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50821#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); 50809#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50816#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50725#L24 assume ~n#1 < 2; 50978#merge_sortFINAL assume true; 50966#merge_sortEXIT >#88#return; 50811#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 50984#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50985#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); 50724#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50722#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50725#L24 assume ~n#1 < 2; 50978#merge_sortFINAL assume true; 50966#merge_sortEXIT >#88#return; 50967#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 51039#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51041#L24 assume ~n#1 < 2; 51040#merge_sortFINAL assume true; 51038#merge_sortEXIT >#90#return; 51037#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51036#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51035#L12 assume !(merge_~j~0#1 == merge_~n#1); 51034#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51033#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51031#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51029#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51027#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51025#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51020#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51021#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51018#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51019#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51003#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51004#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51000#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 50993#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 50994#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51071#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51070#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51005#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51006#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 50880#L11-4 merge_~i~0#1 := 0; 50868#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50864#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50850#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50842#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50837#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50832#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50828#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50827#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50825#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 50824#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 50820#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 50815#merge_sortFINAL assume true; 50808#merge_sortEXIT >#90#return; 50713#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51204#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51203#L12 assume !(merge_~j~0#1 == merge_~n#1); 51202#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51200#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51199#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51198#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51197#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51196#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51195#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51194#L12 assume !(merge_~j~0#1 == merge_~n#1); 51193#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51191#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51190#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51189#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51188#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51187#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51186#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51182#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51183#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51243#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51239#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 50840#L11-4 merge_~i~0#1 := 0; 50835#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50831#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50829#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50826#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50823#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50822#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50819#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 50814#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 50807#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 50804#merge_sortFINAL assume true; 50798#merge_sortEXIT >#90#return; 50801#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51340#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51339#L12 assume !(merge_~j~0#1 == merge_~n#1); 51338#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51336#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51335#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51334#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51333#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51332#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51331#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51330#L12 assume !(merge_~j~0#1 == merge_~n#1); 51329#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51327#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51326#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51325#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51324#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51323#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51322#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51320#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51317#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51314#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51311#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51312#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51309#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51379#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51313#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 51298#L11-4 merge_~i~0#1 := 0; 51297#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 51296#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 51295#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 51294#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 51293#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 51292#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 51291#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 51290#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 51287#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 51286#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 51285#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51284#merge_sortFINAL assume true; 51283#merge_sortEXIT >#88#return; 50688#L27-1 [2023-11-29 06:00:52,420 INFO L750 eck$LassoCheckResult]: Loop: 50688#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 50780#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50781#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); 50689#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50777#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50738#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); 50687#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50813#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50738#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); 50687#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50813#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50939#L24 assume ~n#1 < 2; 50977#merge_sortFINAL assume true; 50968#merge_sortEXIT >#88#return; 50811#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 50984#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50985#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); 50724#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50722#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50725#L24 assume ~n#1 < 2; 50978#merge_sortFINAL assume true; 50966#merge_sortEXIT >#88#return; 50967#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 51039#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51041#L24 assume ~n#1 < 2; 51040#merge_sortFINAL assume true; 51038#merge_sortEXIT >#90#return; 51037#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51036#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51035#L12 assume !(merge_~j~0#1 == merge_~n#1); 51034#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51033#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51031#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51029#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51027#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51025#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51020#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51021#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51018#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51019#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51003#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51004#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51000#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 50993#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 50994#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51071#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51070#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51005#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51006#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 50880#L11-4 merge_~i~0#1 := 0; 50868#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50864#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50850#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50842#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50837#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50832#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50828#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50827#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50825#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 50824#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 50820#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 50815#merge_sortFINAL assume true; 50808#merge_sortEXIT >#90#return; 50713#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51204#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51203#L12 assume !(merge_~j~0#1 == merge_~n#1); 51202#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51200#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51199#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51198#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51197#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51196#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51195#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51194#L12 assume !(merge_~j~0#1 == merge_~n#1); 51193#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51191#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51190#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51189#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51188#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51187#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51186#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51182#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51183#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51243#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51239#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 50840#L11-4 merge_~i~0#1 := 0; 50835#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50831#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50829#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50826#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50823#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50822#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50819#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 50814#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 50807#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 50804#merge_sortFINAL assume true; 50798#merge_sortEXIT >#88#return; 50792#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 50795#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50821#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); 50809#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50816#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50725#L24 assume ~n#1 < 2; 50978#merge_sortFINAL assume true; 50966#merge_sortEXIT >#88#return; 50811#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 50984#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50985#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); 50724#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50722#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50725#L24 assume ~n#1 < 2; 50978#merge_sortFINAL assume true; 50966#merge_sortEXIT >#88#return; 50967#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 51039#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51041#L24 assume ~n#1 < 2; 51040#merge_sortFINAL assume true; 51038#merge_sortEXIT >#90#return; 51037#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51036#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51035#L12 assume !(merge_~j~0#1 == merge_~n#1); 51034#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51033#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51031#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51029#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51027#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51025#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51020#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51021#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51018#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51019#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51003#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51004#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51000#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 50993#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 50994#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51071#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51070#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51005#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51006#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 50880#L11-4 merge_~i~0#1 := 0; 50868#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50864#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50850#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50842#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50837#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50832#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50828#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50827#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50825#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 50824#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 50820#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 50815#merge_sortFINAL assume true; 50808#merge_sortEXIT >#90#return; 50713#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51204#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51203#L12 assume !(merge_~j~0#1 == merge_~n#1); 51202#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51200#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51199#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51198#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51197#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51196#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51195#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51194#L12 assume !(merge_~j~0#1 == merge_~n#1); 51193#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51191#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51190#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51189#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51188#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51187#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51186#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51182#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51183#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51243#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51239#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 50840#L11-4 merge_~i~0#1 := 0; 50835#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50831#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50829#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50826#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50823#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50822#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50819#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 50814#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 50807#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 50804#merge_sortFINAL assume true; 50798#merge_sortEXIT >#90#return; 50801#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51340#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51339#L12 assume !(merge_~j~0#1 == merge_~n#1); 51338#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51336#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51335#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51334#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51333#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51332#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51331#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51330#L12 assume !(merge_~j~0#1 == merge_~n#1); 51329#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51327#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 51326#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51325#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51324#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51323#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51322#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51320#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51317#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51314#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51311#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51312#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 51309#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51379#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51313#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 51298#L11-4 merge_~i~0#1 := 0; 51297#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 51296#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 51295#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 51294#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 51293#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 51292#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 51291#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 51290#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 51287#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 51286#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 51285#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 51284#merge_sortFINAL assume true; 51283#merge_sortEXIT >#88#return; 50688#L27-1 [2023-11-29 06:00:52,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:00:52,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1770930983, now seen corresponding path program 22 times [2023-11-29 06:00:52,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:00:52,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583400413] [2023-11-29 06:00:52,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:00:52,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:00:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:54,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:00:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:54,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:54,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:00:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:54,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:54,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:00:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:54,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:00:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:54,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:54,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:00:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:54,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:00:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:54,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:00:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:00:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1607 backedges. 447 proven. 322 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2023-11-29 06:00:54,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:00:54,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583400413] [2023-11-29 06:00:54,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583400413] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:00:54,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002957875] [2023-11-29 06:00:54,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 06:00:54,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:00:54,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:54,528 INFO L229 MonitoredProcess]: Starting monitored process 189 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:00:54,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (189)] Waiting until timeout for monitored process [2023-11-29 06:09:15,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 06:09:15,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:09:15,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 06:09:15,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:09:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1607 backedges. 745 proven. 0 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2023-11-29 06:09:16,091 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:09:16,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002957875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:09:16,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:09:16,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [31] total 39 [2023-11-29 06:09:16,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768184699] [2023-11-29 06:09:16,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:09:16,092 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 06:09:16,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:09:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1654982020, now seen corresponding path program 4 times [2023-11-29 06:09:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:09:16,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907071653] [2023-11-29 06:09:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:09:16,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:09:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 06:09:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:17,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:09:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:17,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:09:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:17,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:09:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:17,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:09:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:17,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:09:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:17,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 06:09:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:09:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:17,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:09:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:17,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:09:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:17,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:09:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 472 proven. 599 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2023-11-29 06:09:17,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:09:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907071653] [2023-11-29 06:09:17,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907071653] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:09:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585722546] [2023-11-29 06:09:17,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 06:09:17,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:09:17,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:09:17,963 INFO L229 MonitoredProcess]: Starting monitored process 190 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:09:17,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (190)] Waiting until timeout for monitored process [2023-11-29 06:09:28,693 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 06:09:28,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:09:28,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 06:09:28,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:09:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 852 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2023-11-29 06:09:28,840 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:09:28,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585722546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:09:28,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:09:28,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [24] total 29 [2023-11-29 06:09:28,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782697027] [2023-11-29 06:09:28,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:09:28,841 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:09:28,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:09:28,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:09:28,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2023-11-29 06:09:28,841 INFO L87 Difference]: Start difference. First operand 1133 states and 1411 transitions. cyclomatic complexity: 304 Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 06:09:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:09:28,993 INFO L93 Difference]: Finished difference Result 993 states and 1208 transitions. [2023-11-29 06:09:28,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 993 states and 1208 transitions. [2023-11-29 06:09:28,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-29 06:09:29,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 993 states to 959 states and 1170 transitions. [2023-11-29 06:09:29,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2023-11-29 06:09:29,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2023-11-29 06:09:29,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 959 states and 1170 transitions. [2023-11-29 06:09:29,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 06:09:29,010 INFO L218 hiAutomatonCegarLoop]: Abstraction has 959 states and 1170 transitions. [2023-11-29 06:09:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states and 1170 transitions. [2023-11-29 06:09:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 950. [2023-11-29 06:09:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 907 states have (on average 1.1686879823594267) internal successors, (1060), 906 states have internal predecessors, (1060), 28 states have call successors, (28), 20 states have call predecessors, (28), 15 states have return successors, (73), 23 states have call predecessors, (73), 25 states have call successors, (73) [2023-11-29 06:09:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1161 transitions. [2023-11-29 06:09:29,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 950 states and 1161 transitions. [2023-11-29 06:09:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:09:29,031 INFO L428 stractBuchiCegarLoop]: Abstraction has 950 states and 1161 transitions. [2023-11-29 06:09:29,031 INFO L335 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2023-11-29 06:09:29,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 950 states and 1161 transitions. [2023-11-29 06:09:29,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-29 06:09:29,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:09:29,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:09:29,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 14, 14, 14, 14, 14, 14, 11, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2023-11-29 06:09:29,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 20, 20, 20, 16, 15, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7] [2023-11-29 06:09:29,039 INFO L748 eck$LassoCheckResult]: Stem: 55428#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 55378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet21#1, main_#t~post20#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; 55379#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; 55381#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55382#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55383#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55384#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55385#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55455#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55454#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55453#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55452#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55451#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55450#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55449#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55448#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55447#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55446#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55445#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55444#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55443#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55442#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55441#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55440#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55439#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55438#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55437#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55436#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55435#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55434#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55433#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55432#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 55431#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 55430#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 55425#L40-4 havoc main_~i~1#1; 55348#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 55349#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55469#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); 55397#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55467#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55512#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); 55369#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55398#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55573#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); 55368#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55398#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55573#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); 55368#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55398#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55573#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); 55368#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55398#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55574#L24 assume ~n#1 < 2; 55572#merge_sortFINAL assume true; 55570#merge_sortEXIT >#88#return; 55372#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55568#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55571#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); 55394#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55396#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55419#L24 assume ~n#1 < 2; 55393#merge_sortFINAL assume true; 55395#merge_sortEXIT >#88#return; 55622#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55652#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55654#L24 assume ~n#1 < 2; 55653#merge_sortFINAL assume true; 55651#merge_sortEXIT >#90#return; 55650#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55649#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55648#L12 assume !(merge_~j~0#1 == merge_~n#1); 55647#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55644#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55642#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55640#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55638#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55636#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55632#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55629#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 55628#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55627#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55626#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 55424#L11-4 merge_~i~0#1 := 0; 55417#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55415#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55416#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55418#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55620#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 55371#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 55373#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55380#merge_sortFINAL assume true; 55391#merge_sortEXIT >#90#return; 55392#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55715#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55714#L12 assume !(merge_~j~0#1 == merge_~n#1); 55713#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55711#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55710#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55709#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55708#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55707#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55706#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55705#L12 assume !(merge_~j~0#1 == merge_~n#1); 55704#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55702#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55701#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55700#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55699#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55698#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55697#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55693#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 55694#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55728#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55684#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 55532#L11-4 merge_~i~0#1 := 0; 55528#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55524#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55523#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55520#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55517#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55516#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55513#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 55508#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 55505#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55502#merge_sortFINAL assume true; 55499#merge_sortEXIT >#88#return; 55353#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55494#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55515#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); 55357#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55510#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55457#L24 assume ~n#1 < 2; 55591#merge_sortFINAL assume true; 55581#merge_sortEXIT >#88#return; 55352#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55595#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55596#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); 55582#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55587#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55457#L24 assume ~n#1 < 2; 55591#merge_sortFINAL assume true; 55581#merge_sortEXIT >#88#return; 55405#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55404#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55406#L24 assume ~n#1 < 2; 55623#merge_sortFINAL assume true; 55624#merge_sortEXIT >#90#return; 55662#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55661#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55660#L12 assume !(merge_~j~0#1 == merge_~n#1); 55659#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55399#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55400#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55657#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55658#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55665#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55664#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55663#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 55426#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55625#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55539#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 55534#L11-4 merge_~i~0#1 := 0; 55530#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55526#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55522#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55521#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55519#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 55518#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 55514#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55509#merge_sortFINAL assume true; 55506#merge_sortEXIT >#90#return; 55392#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55715#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55714#L12 assume !(merge_~j~0#1 == merge_~n#1); 55713#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55711#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55710#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55709#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55708#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55707#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55706#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55705#L12 assume !(merge_~j~0#1 == merge_~n#1); 55704#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55702#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55701#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55700#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55699#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55698#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55697#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55693#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 55694#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55728#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55684#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 55532#L11-4 merge_~i~0#1 := 0; 55528#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55524#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55523#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55520#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55517#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55516#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55513#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 55508#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 55505#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55502#merge_sortFINAL assume true; 55499#merge_sortEXIT >#90#return; 55500#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55410#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55411#L12 assume !(merge_~j~0#1 == merge_~n#1); 56143#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 56141#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 56140#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 56139#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 56138#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 56137#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 56136#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 56135#L12 assume !(merge_~j~0#1 == merge_~n#1); 56134#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 56132#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 56131#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 56130#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 56129#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 56128#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 56127#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 56124#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 56125#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 56162#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 56115#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 56114#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 56111#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 56157#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 56113#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 55614#L11-4 merge_~i~0#1 := 0; 55615#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55608#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55609#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55603#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55604#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55597#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55577#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55575#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55576#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 55490#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 55491#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55484#merge_sortFINAL assume true; 55485#merge_sortEXIT >#88#return; 55356#L27-1 [2023-11-29 06:09:29,040 INFO L750 eck$LassoCheckResult]: Loop: 55356#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55462#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55459#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); 55363#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55456#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55408#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); 55351#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55407#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55408#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); 55351#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55407#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55408#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); 55351#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55407#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55409#L24 assume ~n#1 < 2; 55592#merge_sortFINAL assume true; 55584#merge_sortEXIT >#88#return; 55352#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55595#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55596#L24 assume ~n#1 < 2; 55623#merge_sortFINAL assume true; 55624#merge_sortEXIT >#90#return; 55662#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55661#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55660#L12 assume !(merge_~j~0#1 == merge_~n#1); 55659#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55399#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55400#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55657#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55658#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55665#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55664#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55663#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 55426#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55625#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55539#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 55534#L11-4 merge_~i~0#1 := 0; 55530#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55526#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55522#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55521#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55519#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 55518#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 55514#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55509#merge_sortFINAL assume true; 55506#merge_sortEXIT >#88#return; 55355#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55503#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55589#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); 55583#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55587#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55457#L24 assume ~n#1 < 2; 55591#merge_sortFINAL assume true; 55581#merge_sortEXIT >#88#return; 55352#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55595#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55596#L24 assume ~n#1 < 2; 55623#merge_sortFINAL assume true; 55624#merge_sortEXIT >#90#return; 55662#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55661#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55660#L12 assume !(merge_~j~0#1 == merge_~n#1); 55659#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55399#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55400#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55657#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55658#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55665#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55664#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55663#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 55426#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55625#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55539#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 55534#L11-4 merge_~i~0#1 := 0; 55530#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55526#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55522#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55521#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55519#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 55518#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 55514#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55509#merge_sortFINAL assume true; 55506#merge_sortEXIT >#90#return; 55507#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55934#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55933#L12 assume !(merge_~j~0#1 == merge_~n#1); 55932#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55930#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55929#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55928#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55927#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55926#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55925#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55924#L12 assume !(merge_~j~0#1 == merge_~n#1); 55923#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55921#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55920#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55919#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55918#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55917#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55916#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55914#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 55909#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55910#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55902#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55903#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 55900#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55998#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55904#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 55824#L11-4 merge_~i~0#1 := 0; 55823#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55822#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55821#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55820#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55819#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55818#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55817#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55816#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55815#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 55814#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 55813#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55492#merge_sortFINAL assume true; 55493#merge_sortEXIT >#88#return; 55359#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55486#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55504#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); 55362#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55501#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55590#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); 55586#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55588#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55409#L24 assume ~n#1 < 2; 55592#merge_sortFINAL assume true; 55584#merge_sortEXIT >#88#return; 55352#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55595#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55596#L24 assume ~n#1 < 2; 55623#merge_sortFINAL assume true; 55624#merge_sortEXIT >#90#return; 55662#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55661#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55660#L12 assume !(merge_~j~0#1 == merge_~n#1); 55659#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55399#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55400#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55657#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55658#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55665#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55664#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55663#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 55426#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55625#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55539#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 55534#L11-4 merge_~i~0#1 := 0; 55530#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55526#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55522#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55521#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55519#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 55518#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 55514#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55509#merge_sortFINAL assume true; 55506#merge_sortEXIT >#88#return; 55355#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55503#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55589#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); 55583#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 55587#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55457#L24 assume ~n#1 < 2; 55591#merge_sortFINAL assume true; 55581#merge_sortEXIT >#88#return; 55352#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 55595#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 55596#L24 assume ~n#1 < 2; 55623#merge_sortFINAL assume true; 55624#merge_sortEXIT >#90#return; 55662#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55661#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55660#L12 assume !(merge_~j~0#1 == merge_~n#1); 55659#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55399#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55400#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55657#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55658#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55665#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55664#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55663#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 55426#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55625#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55539#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 55534#L11-4 merge_~i~0#1 := 0; 55530#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55526#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55522#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55521#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55519#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 55518#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 55514#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55509#merge_sortFINAL assume true; 55506#merge_sortEXIT >#90#return; 55507#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55934#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55933#L12 assume !(merge_~j~0#1 == merge_~n#1); 55932#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55930#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55929#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55928#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55927#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55926#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55925#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55924#L12 assume !(merge_~j~0#1 == merge_~n#1); 55923#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55921#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 55920#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55919#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 55918#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55917#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55916#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55914#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 55909#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55910#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55902#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 55903#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 55900#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 55998#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 55904#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 55824#L11-4 merge_~i~0#1 := 0; 55823#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55822#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55821#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55820#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55819#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55818#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55817#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55816#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55815#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 55814#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 55813#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55492#merge_sortFINAL assume true; 55493#merge_sortEXIT >#90#return; 55465#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 56036#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 56035#L12 assume !(merge_~j~0#1 == merge_~n#1); 56034#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 56032#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 56031#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 56030#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 56029#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 56028#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 56027#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 56026#L12 assume !(merge_~j~0#1 == merge_~n#1); 56025#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 56023#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 56022#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 56021#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 56020#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 56019#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 56018#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 56015#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 56016#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 56102#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 56005#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 56006#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 56003#L12-2 call write~int#0(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 56013#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 56007#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 55617#L11-4 merge_~i~0#1 := 0; 55611#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55612#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55605#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55606#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55599#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55600#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55578#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#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~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 55579#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 55495#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 55496#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 55487#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~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; 55488#merge_sortFINAL assume true; 55464#merge_sortEXIT >#88#return; 55356#L27-1 [2023-11-29 06:09:29,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:09:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash 219878503, now seen corresponding path program 23 times [2023-11-29 06:09:29,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:09:29,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859492577] [2023-11-29 06:09:29,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:09:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:09:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:30,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:09:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:30,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:09:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:09:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:30,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:09:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:30,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:09:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:30,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:09:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:30,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:09:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:30,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:09:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:30,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:09:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:30,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:09:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:30,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:09:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1413 backedges. 395 proven. 322 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2023-11-29 06:09:30,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:09:30,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859492577] [2023-11-29 06:09:30,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859492577] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:09:30,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960142879] [2023-11-29 06:09:30,795 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 06:09:30,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:09:30,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:09:30,796 INFO L229 MonitoredProcess]: Starting monitored process 191 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:09:30,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103556e8-e92c-4a7e-92ae-f2579597c705/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (191)] Waiting until timeout for monitored process