./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 527bcce2 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_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx --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 32bit --witnessprinter.graph.data.programhash ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:18:02,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:18:02,789 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-21 22:18:02,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:18:02,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:18:02,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:18:02,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:18:02,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:18:02,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:18:02,830 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:18:02,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:18:02,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:18:02,833 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:18:02,833 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 22:18:02,834 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 22:18:02,835 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 22:18:02,835 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 22:18:02,836 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 22:18:02,837 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 22:18:02,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:18:02,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 22:18:02,839 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:18:02,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:18:02,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:18:02,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:18:02,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 22:18:02,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 22:18:02,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 22:18:02,843 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:18:02,843 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:18:02,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:18:02,844 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 22:18:02,845 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:18:02,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:18:02,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:18:02,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:18:02,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:18:02,848 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 22:18:02,849 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_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/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_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 [2023-11-21 22:18:03,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:18:03,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:18:03,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:18:03,215 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:18:03,215 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:18:03,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2023-11-21 22:18:06,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:18:07,137 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:18:07,138 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2023-11-21 22:18:07,159 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/data/3dd474f86/2e40dd1331bd44c5887909b4587ed1c0/FLAG2f7ec7b46 [2023-11-21 22:18:07,177 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/data/3dd474f86/2e40dd1331bd44c5887909b4587ed1c0 [2023-11-21 22:18:07,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:18:07,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:18:07,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:18:07,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:18:07,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:18:07,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aab5236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07, skipping insertion in model container [2023-11-21 22:18:07,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,279 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:18:07,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:18:07,678 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:18:07,754 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:18:07,796 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:18:07,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07 WrapperNode [2023-11-21 22:18:07,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:18:07,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:18:07,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:18:07,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:18:07,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,878 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2023-11-21 22:18:07,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:18:07,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:18:07,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:18:07,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:18:07,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,900 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,918 INFO L187 HeapSplitter]: Split 7 memory accesses to 1 slices as follows [7] [2023-11-21 22:18:07,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:18:07,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:18:07,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:18:07,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:18:07,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (1/1) ... [2023-11-21 22:18:07,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:07,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:08,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:08,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 22:18:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 22:18:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:18:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:18:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:18:08,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:18:08,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:18:08,200 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:18:08,202 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:18:08,349 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:18:08,359 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:18:08,359 INFO L308 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-21 22:18:08,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:18:08 BoogieIcfgContainer [2023-11-21 22:18:08,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:18:08,362 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 22:18:08,363 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 22:18:08,367 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 22:18:08,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:18:08,368 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 10:18:07" (1/3) ... [2023-11-21 22:18:08,369 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@333c5480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:18:08, skipping insertion in model container [2023-11-21 22:18:08,370 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:18:08,370 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:07" (2/3) ... [2023-11-21 22:18:08,370 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@333c5480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:18:08, skipping insertion in model container [2023-11-21 22:18:08,371 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:18:08,371 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:18:08" (3/3) ... [2023-11-21 22:18:08,372 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2023-11-21 22:18:08,436 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 22:18:08,436 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 22:18:08,436 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 22:18:08,436 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 22:18:08,437 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 22:18:08,437 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 22:18:08,437 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 22:18:08,437 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 22:18:08,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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-21 22:18:08,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2023-11-21 22:18:08,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:08,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:08,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-21 22:18:08,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:18:08,470 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 22:18:08,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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-21 22:18:08,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2023-11-21 22:18:08,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:08,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:08,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-21 22:18:08,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:18:08,482 INFO L748 eck$LassoCheckResult]: Stem: 13#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 10#L523true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 12#L523-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 4#L528-3true [2023-11-21 22:18:08,482 INFO L750 eck$LassoCheckResult]: Loop: 4#L528-3true assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 8#L528-2true main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4#L528-3true [2023-11-21 22:18:08,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:08,488 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2023-11-21 22:18:08,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:08,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988740596] [2023-11-21 22:18:08,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:08,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:08,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:08,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2023-11-21 22:18:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:08,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050249664] [2023-11-21 22:18:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:08,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:08,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:08,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:08,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2023-11-21 22:18:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:08,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479335621] [2023-11-21 22:18:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:08,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:08,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:08,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:09,186 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:18:09,187 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:18:09,187 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:18:09,187 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:18:09,188 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:18:09,188 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:09,188 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:18:09,188 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:18:09,188 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2023-11-21 22:18:09,189 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:18:09,189 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:18:09,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:09,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:09,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:09,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:09,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-21 22:18:09,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:09,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:09,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:09,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:09,753 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:18:09,758 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:18:09,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:09,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:09,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:09,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:09,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:09,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:09,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:09,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:09,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:09,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:09,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-21 22:18:09,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:09,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:09,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:09,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:09,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:09,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-21 22:18:09,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-21 22:18:09,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:09,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:09,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:09,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:09,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:09,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:09,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:09,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:09,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:09,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:09,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:09,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:09,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:09,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:09,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:09,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:09,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:09,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-21 22:18:09,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:09,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:09,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:09,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:09,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:09,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:10,004 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:10,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:10,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:10,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:10,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:10,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:10,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-21 22:18:10,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:10,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:10,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:10,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:10,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:10,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:10,071 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:10,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:10,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-21 22:18:10,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:10,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:10,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:10,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:10,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:10,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:10,132 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:18:10,169 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-21 22:18:10,169 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-11-21 22:18:10,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:10,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:10,205 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:10,217 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:18:10,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-21 22:18:10,243 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 22:18:10,244 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:18:10,244 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2023-11-21 22:18:10,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:10,282 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-11-21 22:18:10,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:10,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:18:10,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:10,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:18:10,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:10,391 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-21 22:18:10,434 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-21 22:18:10,437 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 22:18:10,499 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 44 transitions. Complement of second has 8 states. [2023-11-21 22:18:10,501 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-21 22:18:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 22:18:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2023-11-21 22:18:10,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-21 22:18:10,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:10,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 2 letters. [2023-11-21 22:18:10,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:10,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 4 letters. [2023-11-21 22:18:10,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:10,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 44 transitions. [2023-11-21 22:18:10,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-21 22:18:10,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 19 transitions. [2023-11-21 22:18:10,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-11-21 22:18:10,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-21 22:18:10,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2023-11-21 22:18:10,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:10,527 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2023-11-21 22:18:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2023-11-21 22:18:10,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-21 22:18:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-21 22:18:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2023-11-21 22:18:10,555 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2023-11-21 22:18:10,555 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2023-11-21 22:18:10,555 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 22:18:10,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2023-11-21 22:18:10,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-21 22:18:10,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:10,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:10,559 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:18:10,559 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:18:10,559 INFO L748 eck$LassoCheckResult]: Stem: 112#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 102#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 103#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 106#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 104#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 105#L515-3 [2023-11-21 22:18:10,560 INFO L750 eck$LassoCheckResult]: Loop: 105#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 109#L516-3 assume !true; 110#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 105#L515-3 [2023-11-21 22:18:10,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:10,565 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2023-11-21 22:18:10,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:10,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602360966] [2023-11-21 22:18:10,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:10,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:10,682 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-21 22:18:10,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:10,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602360966] [2023-11-21 22:18:10,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602360966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:18:10,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:18:10,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:18:10,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207688183] [2023-11-21 22:18:10,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:18:10,687 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:18:10,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:10,688 INFO L85 PathProgramCache]: Analyzing trace with hash 61120, now seen corresponding path program 1 times [2023-11-21 22:18:10,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:10,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133318703] [2023-11-21 22:18:10,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:10,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:10,696 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-21 22:18:10,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133318703] [2023-11-21 22:18:10,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133318703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:18:10,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:18:10,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:18:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268548191] [2023-11-21 22:18:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:18:10,698 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:18:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:10,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:18:10,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:18:10,702 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-21 22:18:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:10,707 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2023-11-21 22:18:10,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2023-11-21 22:18:10,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-21 22:18:10,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2023-11-21 22:18:10,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-21 22:18:10,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-21 22:18:10,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2023-11-21 22:18:10,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:10,710 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2023-11-21 22:18:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2023-11-21 22:18:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-21 22:18:10,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-21 22:18:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2023-11-21 22:18:10,716 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2023-11-21 22:18:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:18:10,718 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2023-11-21 22:18:10,718 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 22:18:10,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2023-11-21 22:18:10,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-21 22:18:10,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:10,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:10,722 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:18:10,723 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:18:10,723 INFO L748 eck$LassoCheckResult]: Stem: 145#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 146#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 137#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 138#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 139#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 135#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 136#L515-3 [2023-11-21 22:18:10,723 INFO L750 eck$LassoCheckResult]: Loop: 136#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 142#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 143#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 136#L515-3 [2023-11-21 22:18:10,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:10,728 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2023-11-21 22:18:10,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:10,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047018464] [2023-11-21 22:18:10,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:10,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:10,842 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-21 22:18:10,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:10,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047018464] [2023-11-21 22:18:10,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047018464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:18:10,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:18:10,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:18:10,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131999059] [2023-11-21 22:18:10,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:18:10,844 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:18:10,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:10,845 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2023-11-21 22:18:10,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:10,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662436052] [2023-11-21 22:18:10,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:10,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:10,886 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-21 22:18:10,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:10,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662436052] [2023-11-21 22:18:10,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662436052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:18:10,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:18:10,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:18:10,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759943650] [2023-11-21 22:18:10,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:18:10,888 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:18:10,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:10,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:18:10,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:18:10,889 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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-21 22:18:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:10,903 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2023-11-21 22:18:10,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2023-11-21 22:18:10,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-21 22:18:10,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2023-11-21 22:18:10,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-21 22:18:10,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-21 22:18:10,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2023-11-21 22:18:10,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:10,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-21 22:18:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2023-11-21 22:18:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-21 22:18:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-21 22:18:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2023-11-21 22:18:10,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-21 22:18:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:18:10,909 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-21 22:18:10,909 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 22:18:10,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2023-11-21 22:18:10,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-21 22:18:10,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:10,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:10,911 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:18:10,911 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:18:10,911 INFO L748 eck$LassoCheckResult]: Stem: 180#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 172#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 173#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 174#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 170#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 171#L515-3 [2023-11-21 22:18:10,912 INFO L750 eck$LassoCheckResult]: Loop: 171#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 177#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 178#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 182#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 183#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 179#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 171#L515-3 [2023-11-21 22:18:10,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 3 times [2023-11-21 22:18:10,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:10,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035148519] [2023-11-21 22:18:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:10,966 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-21 22:18:10,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:10,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035148519] [2023-11-21 22:18:10,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035148519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:18:10,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:18:10,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:18:10,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814539596] [2023-11-21 22:18:10,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:18:10,968 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:18:10,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:10,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2023-11-21 22:18:10,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:10,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609992131] [2023-11-21 22:18:10,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:10,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:10,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:11,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:11,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:18:11,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:18:11,139 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-21 22:18:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:11,164 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2023-11-21 22:18:11,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2023-11-21 22:18:11,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-21 22:18:11,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2023-11-21 22:18:11,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-21 22:18:11,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-21 22:18:11,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2023-11-21 22:18:11,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:11,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-11-21 22:18:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2023-11-21 22:18:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-11-21 22:18:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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-21 22:18:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2023-11-21 22:18:11,178 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2023-11-21 22:18:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:18:11,180 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2023-11-21 22:18:11,180 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 22:18:11,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2023-11-21 22:18:11,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-21 22:18:11,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:11,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:11,182 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:11,182 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:18:11,182 INFO L748 eck$LassoCheckResult]: Stem: 216#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 206#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 207#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 210#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 211#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 212#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 208#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 209#L515-3 [2023-11-21 22:18:11,182 INFO L750 eck$LassoCheckResult]: Loop: 209#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 213#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 214#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 218#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 219#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 215#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 209#L515-3 [2023-11-21 22:18:11,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:11,183 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2023-11-21 22:18:11,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:11,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99742165] [2023-11-21 22:18:11,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:11,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:11,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:11,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:11,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:11,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2023-11-21 22:18:11,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:11,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848537943] [2023-11-21 22:18:11,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:11,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:11,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:11,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:11,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:11,234 INFO L85 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2023-11-21 22:18:11,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:11,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110447257] [2023-11-21 22:18:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:18:11,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:11,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110447257] [2023-11-21 22:18:11,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110447257] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:11,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185167024] [2023-11-21 22:18:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:11,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:11,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:11,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:11,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 22:18:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:11,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-21 22:18:11,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:18:11,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:11,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:18:11,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185167024] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:11,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:11,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-11-21 22:18:11,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487610769] [2023-11-21 22:18:11,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:11,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:11,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 22:18:11,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:18:11,854 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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-21 22:18:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:11,947 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2023-11-21 22:18:11,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2023-11-21 22:18:11,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-21 22:18:11,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2023-11-21 22:18:11,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-21 22:18:11,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-21 22:18:11,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2023-11-21 22:18:11,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:11,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-11-21 22:18:11,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2023-11-21 22:18:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2023-11-21 22:18:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-21 22:18:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-21 22:18:11,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-21 22:18:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:18:11,959 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-21 22:18:11,959 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 22:18:11,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2023-11-21 22:18:11,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-21 22:18:11,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:11,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:11,961 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:11,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:18:11,962 INFO L748 eck$LassoCheckResult]: Stem: 355#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 346#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 347#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 348#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 349#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 350#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 351#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 359#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 344#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 345#L515-3 [2023-11-21 22:18:11,962 INFO L750 eck$LassoCheckResult]: Loop: 345#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 352#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 353#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 357#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 358#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 354#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 345#L515-3 [2023-11-21 22:18:11,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:11,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2023-11-21 22:18:11,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:11,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085184310] [2023-11-21 22:18:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:11,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:11,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:12,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:12,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2023-11-21 22:18:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:12,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166215310] [2023-11-21 22:18:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:12,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:12,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:12,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:12,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:12,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2023-11-21 22:18:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:12,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174050355] [2023-11-21 22:18:12,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:12,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:12,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:12,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:12,607 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:18:12,607 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:18:12,607 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:18:12,607 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:18:12,607 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:18:12,608 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:12,608 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:18:12,608 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:18:12,608 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2023-11-21 22:18:12,608 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:18:12,608 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:18:12,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:12,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:13,520 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:18:13,520 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:18:13,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:13,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:13,525 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:13,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:13,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-21 22:18:13,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:13,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:13,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:13,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:13,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:13,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:13,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:13,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:13,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:13,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:13,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:13,581 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:13,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-21 22:18:13,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:13,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:13,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:13,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:13,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:13,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:13,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:13,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:13,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:13,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:13,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:13,645 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:13,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:13,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-21 22:18:13,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:13,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:13,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:13,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:13,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:13,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:13,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:13,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:13,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:13,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:13,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:13,706 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:13,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:13,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:13,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:13,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-21 22:18:13,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:13,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:13,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:13,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:13,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:13,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:13,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:13,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:13,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:13,768 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:13,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-21 22:18:13,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:13,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:13,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:13,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:13,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:13,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:13,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:13,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:13,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:13,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:13,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:13,834 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:13,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:13,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-21 22:18:13,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:13,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:13,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:13,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:13,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:13,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:13,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:13,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:13,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:13,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:13,907 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:13,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:13,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-21 22:18:13,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:13,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:13,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:13,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:13,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:13,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:13,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:13,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:13,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:13,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:13,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:13,956 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:13,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:13,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-21 22:18:13,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:13,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:13,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:13,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:13,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:13,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:13,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:13,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:14,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:14,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,017 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-21 22:18:14,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-21 22:18:14,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:14,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:14,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:14,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:14,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:14,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:14,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:14,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:14,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:14,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,049 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-21 22:18:14,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:14,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:14,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:14,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:14,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:14,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:14,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:14,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:14,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:14,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:14,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,110 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,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-21 22:18:14,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-21 22:18:14,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:14,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:14,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:14,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:14,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:14,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:14,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:14,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:14,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,172 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,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-21 22:18:14,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:14,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:14,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:14,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:14,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:14,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:14,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-21 22:18:14,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:14,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:14,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:14,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,232 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-21 22:18:14,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:14,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:14,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:14,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:14,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:14,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:14,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:14,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:14,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:14,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:14,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,294 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:14,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-21 22:18:14,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:14,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:14,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:14,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:14,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:14,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:14,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:14,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:14,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:14,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,354 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:14,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:14,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:14,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:14,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:14,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:14,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:14,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:14,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-21 22:18:14,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:14,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:14,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,420 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:14,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-21 22:18:14,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:14,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:14,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:14,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:14,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:14,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:14,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:14,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:14,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,493 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:14,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-21 22:18:14,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:14,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:14,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:14,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:14,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:14,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:14,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:14,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:14,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:14,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,555 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:14,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-21 22:18:14,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:14,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:14,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:14,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:14,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:14,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:14,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:14,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:14,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:14,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,621 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:14,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-21 22:18:14,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:14,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:14,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:14,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:14,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:14,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:14,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:14,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:14,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,684 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:14,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-21 22:18:14,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:14,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:14,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:14,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:14,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:14,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:14,743 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:18:14,828 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2023-11-21 22:18:14,828 INFO L444 ModelExtractionUtils]: 5 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. [2023-11-21 22:18:14,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:14,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:14,830 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:14,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:18:14,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-21 22:18:14,868 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-21 22:18:14,868 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:18:14,869 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0#1) = -2*ULTIMATE.start_sort_~pass~0#1 + 3 Supporting invariants [-1*ULTIMATE.start_sort_~n#1 + 2 >= 0] [2023-11-21 22:18:14,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-11-21 22:18:14,920 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2023-11-21 22:18:14,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:14,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 22:18:14,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:15,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 22:18:15,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:18:15,172 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2023-11-21 22:18:15,172 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-21 22:18:15,304 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 34 states and 43 transitions. Complement of second has 10 states. [2023-11-21 22:18:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2023-11-21 22:18:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-21 22:18:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2023-11-21 22:18:15,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 10 letters. Loop has 6 letters. [2023-11-21 22:18:15,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:15,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 16 letters. Loop has 6 letters. [2023-11-21 22:18:15,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:15,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 10 letters. Loop has 12 letters. [2023-11-21 22:18:15,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:15,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2023-11-21 22:18:15,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-21 22:18:15,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 42 transitions. [2023-11-21 22:18:15,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-11-21 22:18:15,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-11-21 22:18:15,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2023-11-21 22:18:15,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:18:15,315 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-11-21 22:18:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2023-11-21 22:18:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2023-11-21 22:18:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 states have internal predecessors, (38), 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-21 22:18:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-11-21 22:18:15,320 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-11-21 22:18:15,320 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-11-21 22:18:15,320 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-21 22:18:15,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2023-11-21 22:18:15,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-21 22:18:15,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:15,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:15,327 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:15,327 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:18:15,327 INFO L748 eck$LassoCheckResult]: Stem: 540#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 541#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 524#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 525#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 528#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 529#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 530#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 531#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 550#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 549#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 548#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 532#L516-3 [2023-11-21 22:18:15,327 INFO L750 eck$LassoCheckResult]: Loop: 532#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 533#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 542#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 532#L516-3 [2023-11-21 22:18:15,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2023-11-21 22:18:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353617402] [2023-11-21 22:18:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:15,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:15,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:15,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:15,405 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2023-11-21 22:18:15,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:15,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127461637] [2023-11-21 22:18:15,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:15,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:15,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:15,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:15,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:15,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2023-11-21 22:18:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834812509] [2023-11-21 22:18:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:15,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:15,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:15,975 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:18:15,975 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:18:15,975 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:18:15,975 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:18:15,975 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:18:15,976 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:15,976 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:18:15,976 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:18:15,976 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration7_Lasso [2023-11-21 22:18:15,976 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:18:15,976 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:18:15,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:15,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:15,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:15,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:15,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:15,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:15,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-21 22:18:16,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-21 22:18:16,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:16,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:16,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:16,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:16,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:16,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:16,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:16,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-21 22:18:16,904 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:18:16,905 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:18:16,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:16,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:16,907 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:16,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:16,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-21 22:18:16,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:16,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:16,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:16,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:16,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:16,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:16,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:16,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:16,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:16,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:16,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:16,969 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:16,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-21 22:18: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-21 22:18:16,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:16,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:16,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:16,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:16,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:16,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:16,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:16,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:16,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:16,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:16,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:16,997 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:16,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-21 22:18:16,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-21 22:18:17,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:17,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:17,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:17,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:17,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:17,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:17,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:17,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:17,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-11-21 22:18:17,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:17,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:17,026 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:17,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-21 22:18:17,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-21 22:18:17,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:17,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:17,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:17,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:17,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:17,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:17,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:17,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:17,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:17,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:17,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:17,096 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:17,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:17,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:17,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:17,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:17,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:17,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:17,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:17,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-21 22:18:17,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:17,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:17,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:17,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:17,155 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:17,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:17,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:17,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:17,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:17,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:17,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:17,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:17,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:17,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-11-21 22:18:17,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:17,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:17,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:17,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:17,208 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:17,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:17,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:17,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:17,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:17,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:17,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-11-21 22:18:17,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:17,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:17,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:17,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:17,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:17,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:17,279 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:17,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:17,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:17,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:17,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:17,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:17,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-11-21 22:18:17,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:17,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:17,331 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:18:17,368 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-11-21 22:18:17,368 INFO L444 ModelExtractionUtils]: 6 out of 40 variables were initially zero. Simplification set additionally 30 variables to zero. [2023-11-21 22:18:17,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:17,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:17,372 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:17,374 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:18:17,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-11-21 22:18:17,408 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 22:18:17,408 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:18:17,408 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1, ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~pass~0#1) = -1*ULTIMATE.start_sort_~i~0#1 + 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~pass~0#1 Supporting invariants [] [2023-11-21 22:18:17,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:17,447 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2023-11-21 22:18:17,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:17,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:18:17,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:17,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:18:17,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:17,538 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-21 22:18:17,539 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-21 22:18:17,539 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-21 22:18:17,573 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 56 states and 77 transitions. Complement of second has 7 states. [2023-11-21 22:18:17,574 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-21 22:18:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-21 22:18:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2023-11-21 22:18:17,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2023-11-21 22:18:17,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:17,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2023-11-21 22:18:17,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:17,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2023-11-21 22:18:17,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:17,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 77 transitions. [2023-11-21 22:18:17,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-21 22:18:17,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 42 states and 55 transitions. [2023-11-21 22:18:17,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-11-21 22:18:17,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-11-21 22:18:17,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 55 transitions. [2023-11-21 22:18:17,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:18:17,583 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 55 transitions. [2023-11-21 22:18:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 55 transitions. [2023-11-21 22:18:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2023-11-21 22:18:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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-21 22:18:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2023-11-21 22:18:17,590 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2023-11-21 22:18:17,590 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2023-11-21 22:18:17,590 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-21 22:18:17,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2023-11-21 22:18:17,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-21 22:18:17,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:17,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:17,592 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:17,592 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:18:17,592 INFO L748 eck$LassoCheckResult]: Stem: 715#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 716#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 700#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 701#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 702#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 703#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 704#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 705#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 731#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 720#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 721#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 723#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 730#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 706#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 707#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 727#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 724#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 712#L515-2 [2023-11-21 22:18:17,592 INFO L750 eck$LassoCheckResult]: Loop: 712#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 713#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 729#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 726#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 728#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 725#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 712#L515-2 [2023-11-21 22:18:17,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash 734885288, now seen corresponding path program 1 times [2023-11-21 22:18:17,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:17,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273538850] [2023-11-21 22:18:17,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:17,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:17,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:17,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273538850] [2023-11-21 22:18:17,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273538850] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:17,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116198400] [2023-11-21 22:18:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:17,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:17,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:17,835 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:17,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-11-21 22:18:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:17,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-21 22:18:17,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:18,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116198400] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:18,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:18,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2023-11-21 22:18:18,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841587291] [2023-11-21 22:18:18,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:18,124 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:18:18,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:18,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1946173240, now seen corresponding path program 4 times [2023-11-21 22:18:18,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:18,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972236249] [2023-11-21 22:18:18,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:18,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:18,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:18,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:18,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-21 22:18:18,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-11-21 22:18:18,269 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 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-21 22:18:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:18,532 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2023-11-21 22:18:18,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2023-11-21 22:18:18,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-21 22:18:18,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 53 transitions. [2023-11-21 22:18:18,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-11-21 22:18:18,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-11-21 22:18:18,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2023-11-21 22:18:18,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:18:18,535 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2023-11-21 22:18:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2023-11-21 22:18:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2023-11-21 22:18:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 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-21 22:18:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2023-11-21 22:18:18,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-11-21 22:18:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 22:18:18,544 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-11-21 22:18:18,544 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-21 22:18:18,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2023-11-21 22:18:18,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-21 22:18:18,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:18,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:18,546 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:18,546 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:18:18,548 INFO L748 eck$LassoCheckResult]: Stem: 915#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 916#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 899#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 900#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 903#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 904#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 905#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 906#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 929#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 926#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 925#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 918#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 923#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 924#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 922#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 913#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 914#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 907#L516-3 [2023-11-21 22:18:18,548 INFO L750 eck$LassoCheckResult]: Loop: 907#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 908#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 919#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 907#L516-3 [2023-11-21 22:18:18,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2023-11-21 22:18:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:18,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656097697] [2023-11-21 22:18:18,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:18,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:18,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-11-21 22:18:18,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:18:18,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:18,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656097697] [2023-11-21 22:18:18,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656097697] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:18,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422750530] [2023-11-21 22:18:18,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:18,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:18,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:18,699 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:18,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-11-21 22:18:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:18,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-21 22:18:18,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:18:18,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:18:18,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422750530] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:18,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:18,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-21 22:18:18,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541202527] [2023-11-21 22:18:18,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:18,911 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:18:18,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:18,911 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2023-11-21 22:18:18,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:18,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487032662] [2023-11-21 22:18:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:18,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:18,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:18,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:19,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:19,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-21 22:18:19,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-21 22:18:19,037 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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-21 22:18:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:19,125 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2023-11-21 22:18:19,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2023-11-21 22:18:19,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-21 22:18:19,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 27 states and 33 transitions. [2023-11-21 22:18:19,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-21 22:18:19,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-21 22:18:19,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2023-11-21 22:18:19,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:19,127 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-21 22:18:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2023-11-21 22:18:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-11-21 22:18:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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-21 22:18:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-21 22:18:19,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-21 22:18:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:18:19,132 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-21 22:18:19,133 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-21 22:18:19,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2023-11-21 22:18:19,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-21 22:18:19,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:19,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:19,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:19,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:18:19,134 INFO L748 eck$LassoCheckResult]: Stem: 1100#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1088#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1089#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1092#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1093#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1094#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1095#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1108#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1111#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1110#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1090#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1091#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1096#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1097#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1107#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1098#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1099#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1113#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1112#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1104#L515-2 [2023-11-21 22:18:19,135 INFO L750 eck$LassoCheckResult]: Loop: 1104#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1102#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1103#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1109#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1105#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1106#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1104#L515-2 [2023-11-21 22:18:19,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:19,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1519410425, now seen corresponding path program 2 times [2023-11-21 22:18:19,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:19,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144251048] [2023-11-21 22:18:19,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:19,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:19,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:19,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:19,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1946173240, now seen corresponding path program 5 times [2023-11-21 22:18:19,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:19,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430957538] [2023-11-21 22:18:19,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:19,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:19,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:19,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:19,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:19,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1226538048, now seen corresponding path program 1 times [2023-11-21 22:18:19,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:19,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786049167] [2023-11-21 22:18:19,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:19,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:18:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:19,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786049167] [2023-11-21 22:18:19,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786049167] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:19,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920815248] [2023-11-21 22:18:19,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:19,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:19,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:19,938 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:19,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-11-21 22:18:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:20,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-21 22:18:20,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:20,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:18:20,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2023-11-21 22:18:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-21 22:18:20,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:20,327 INFO L349 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2023-11-21 22:18:20,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 30 [2023-11-21 22:18:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-21 22:18:20,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920815248] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:20,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:20,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 20 [2023-11-21 22:18:20,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257167414] [2023-11-21 22:18:20,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:20,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:20,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-21 22:18:20,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-11-21 22:18:20,516 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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-21 22:18:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:20,817 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2023-11-21 22:18:20,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2023-11-21 22:18:20,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2023-11-21 22:18:20,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2023-11-21 22:18:20,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-11-21 22:18:20,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-11-21 22:18:20,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2023-11-21 22:18:20,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:20,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 59 transitions. [2023-11-21 22:18:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2023-11-21 22:18:20,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2023-11-21 22:18:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 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-21 22:18:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2023-11-21 22:18:20,829 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-11-21 22:18:20,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 22:18:20,831 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-11-21 22:18:20,831 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-21 22:18:20,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2023-11-21 22:18:20,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2023-11-21 22:18:20,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:20,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:20,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:20,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2023-11-21 22:18:20,836 INFO L748 eck$LassoCheckResult]: Stem: 1363#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1351#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1352#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1355#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1356#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1357#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1358#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1372#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1376#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1375#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1353#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1354#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1380#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1379#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1378#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1361#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1362#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1374#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1385#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1382#L515-2 [2023-11-21 22:18:20,836 INFO L750 eck$LassoCheckResult]: Loop: 1382#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1381#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1359#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1360#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1368#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1369#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1377#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1387#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1383#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1382#L515-2 [2023-11-21 22:18:20,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1519408503, now seen corresponding path program 1 times [2023-11-21 22:18:20,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:20,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871126762] [2023-11-21 22:18:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:20,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:20,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:20,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:20,901 INFO L85 PathProgramCache]: Analyzing trace with hash -683362729, now seen corresponding path program 6 times [2023-11-21 22:18:20,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:20,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57674108] [2023-11-21 22:18:20,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:20,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:20,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:20,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:20,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1528702369, now seen corresponding path program 2 times [2023-11-21 22:18:20,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:20,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387484455] [2023-11-21 22:18:20,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:20,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:18:21,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:21,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387484455] [2023-11-21 22:18:21,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387484455] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:21,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941358403] [2023-11-21 22:18:21,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:18:21,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:21,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:21,223 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:21,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-11-21 22:18:21,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:18:21,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:18:21,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 22:18:21,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:18:21,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:18:21,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941358403] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:21,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:21,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2023-11-21 22:18:21,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367042989] [2023-11-21 22:18:21,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:21,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-21 22:18:21,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2023-11-21 22:18:21,891 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 15 Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 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-21 22:18:22,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:22,092 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2023-11-21 22:18:22,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 82 transitions. [2023-11-21 22:18:22,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-21 22:18:22,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 82 transitions. [2023-11-21 22:18:22,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-21 22:18:22,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-21 22:18:22,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 82 transitions. [2023-11-21 22:18:22,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:22,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 82 transitions. [2023-11-21 22:18:22,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 82 transitions. [2023-11-21 22:18:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2023-11-21 22:18:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 60 states have internal predecessors, (79), 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-21 22:18:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2023-11-21 22:18:22,100 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 79 transitions. [2023-11-21 22:18:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 22:18:22,101 INFO L428 stractBuchiCegarLoop]: Abstraction has 61 states and 79 transitions. [2023-11-21 22:18:22,101 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-21 22:18:22,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 79 transitions. [2023-11-21 22:18:22,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-21 22:18:22,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:22,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:22,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:22,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:18:22,103 INFO L748 eck$LassoCheckResult]: Stem: 1667#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1668#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1655#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1656#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1659#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1660#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1680#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1683#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1661#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1662#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1715#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1714#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1669#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1663#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1664#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1674#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1665#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1666#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1704#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1713#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1685#L515-2 [2023-11-21 22:18:22,104 INFO L750 eck$LassoCheckResult]: Loop: 1685#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1684#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1681#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1682#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1672#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1673#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1685#L515-2 [2023-11-21 22:18:22,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:22,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1519410425, now seen corresponding path program 3 times [2023-11-21 22:18:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832837963] [2023-11-21 22:18:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:22,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:22,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:22,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:22,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:22,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1946171318, now seen corresponding path program 1 times [2023-11-21 22:18:22,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:22,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557908616] [2023-11-21 22:18:22,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:22,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:22,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:22,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:22,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:22,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1226536126, now seen corresponding path program 2 times [2023-11-21 22:18:22,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:22,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272051623] [2023-11-21 22:18:22,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:22,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:22,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:22,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:23,366 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:18:23,366 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:18:23,366 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:18:23,366 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:18:23,366 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:18:23,367 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:23,367 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:18:23,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:18:23,367 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration12_Lasso [2023-11-21 22:18:23,367 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:18:23,367 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:18:23,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-21 22:18:23,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:23,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-21 22:18:23,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:23,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:23,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-21 22:18:23,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-21 22:18:23,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:23,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:23,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:23,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:23,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-21 22:18:23,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:23,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-21 22:18:23,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-21 22:18:23,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-21 22:18:23,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:23,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:23,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-21 22:18:23,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:23,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:24,023 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:18:24,023 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:18:24,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:24,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:24,026 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:24,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-21 22:18:24,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-21 22:18:24,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:24,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:24,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:24,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:24,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:24,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:24,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:24,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:24,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-11-21 22:18:24,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:24,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:24,060 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:24,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-21 22:18:24,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:24,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:24,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:24,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:24,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:24,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:24,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:24,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:24,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:24,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-11-21 22:18:24,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:24,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:24,093 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:24,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-21 22:18:24,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:24,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:24,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:24,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:24,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:24,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:24,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:24,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:24,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:24,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:24,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:24,140 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:24,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:24,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-11-21 22:18:24,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:24,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:24,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:24,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:24,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:24,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:24,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:24,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-11-21 22:18:24,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:24,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:24,176 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:24,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-11-21 22:18:24,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:24,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:24,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:24,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:24,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:24,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:24,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:24,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:24,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:24,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-11-21 22:18:24,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:24,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:24,203 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:24,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-11-21 22:18:24,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:24,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:24,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:24,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:24,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:24,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:24,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:24,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:24,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-11-21 22:18:24,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:24,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:24,238 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:24,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:24,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:24,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:24,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:24,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:24,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:24,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:24,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:24,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-11-21 22:18:24,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:24,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:24,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:24,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:24,295 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:24,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:24,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:24,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:24,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:24,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:24,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:24,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:24,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:24,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-11-21 22:18:24,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:24,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:24,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:24,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:24,343 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:24,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-11-21 22:18:24,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:24,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:24,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:24,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:24,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:24,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:24,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:24,373 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:18:24,382 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-11-21 22:18:24,383 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-11-21 22:18:24,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:24,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:24,384 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:24,391 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:18:24,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-11-21 22:18:24,409 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-21 22:18:24,409 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:18:24,409 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0#1) = -2*ULTIMATE.start_sort_~pass~0#1 + 3 Supporting invariants [-1*ULTIMATE.start_sort_~n#1 + 3 >= 0] [2023-11-21 22:18:24,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2023-11-21 22:18:24,445 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2023-11-21 22:18:24,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:24,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-21 22:18:24,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:24,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 22:18:24,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:18:24,787 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-21 22:18:24,787 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 79 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-21 22:18:24,994 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 79 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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 75 states and 95 transitions. Complement of second has 14 states. [2023-11-21 22:18:24,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2023-11-21 22:18:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-21 22:18:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2023-11-21 22:18:24,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 20 letters. Loop has 6 letters. [2023-11-21 22:18:24,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:24,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 26 letters. Loop has 6 letters. [2023-11-21 22:18:24,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:24,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 20 letters. Loop has 12 letters. [2023-11-21 22:18:24,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:24,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 95 transitions. [2023-11-21 22:18:24,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2023-11-21 22:18:25,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 44 states and 55 transitions. [2023-11-21 22:18:25,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-11-21 22:18:25,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2023-11-21 22:18:25,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 55 transitions. [2023-11-21 22:18:25,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:25,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 55 transitions. [2023-11-21 22:18:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 55 transitions. [2023-11-21 22:18:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2023-11-21 22:18:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 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-21 22:18:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2023-11-21 22:18:25,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-11-21 22:18:25,005 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-11-21 22:18:25,005 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-21 22:18:25,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2023-11-21 22:18:25,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2023-11-21 22:18:25,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:25,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:25,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:25,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2023-11-21 22:18:25,008 INFO L748 eck$LassoCheckResult]: Stem: 1963#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1964#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1951#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1952#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1953#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1954#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1955#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1956#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1977#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1974#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1972#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1970#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1969#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1949#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1950#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1987#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1968#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1967#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1959#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1960#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1984#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1981#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1978#L515-2 [2023-11-21 22:18:25,008 INFO L750 eck$LassoCheckResult]: Loop: 1978#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1975#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1976#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1971#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1965#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1966#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1973#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1983#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1979#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1978#L515-2 [2023-11-21 22:18:25,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:25,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2059791961, now seen corresponding path program 2 times [2023-11-21 22:18:25,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:25,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840054854] [2023-11-21 22:18:25,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:25,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:25,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:25,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:25,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840054854] [2023-11-21 22:18:25,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840054854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:25,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019053681] [2023-11-21 22:18:25,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:18:25,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:25,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:25,233 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:25,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2023-11-21 22:18:25,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:18:25,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:18:25,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 22:18:25,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:25,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019053681] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:25,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2023-11-21 22:18:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939274033] [2023-11-21 22:18:25,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:25,615 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:18:25,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:25,615 INFO L85 PathProgramCache]: Analyzing trace with hash -683362729, now seen corresponding path program 7 times [2023-11-21 22:18:25,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:25,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380895581] [2023-11-21 22:18:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:25,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:25,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:25,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:25,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:25,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-21 22:18:25,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2023-11-21 22:18:25,861 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. cyclomatic complexity: 15 Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 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-21 22:18:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:26,081 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2023-11-21 22:18:26,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 64 transitions. [2023-11-21 22:18:26,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2023-11-21 22:18:26,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 64 transitions. [2023-11-21 22:18:26,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-11-21 22:18:26,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-11-21 22:18:26,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions. [2023-11-21 22:18:26,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:26,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-11-21 22:18:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions. [2023-11-21 22:18:26,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2023-11-21 22:18:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 43 states have internal predecessors, (56), 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-21 22:18:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2023-11-21 22:18:26,086 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2023-11-21 22:18:26,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-21 22:18:26,087 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2023-11-21 22:18:26,088 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-21 22:18:26,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2023-11-21 22:18:26,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2023-11-21 22:18:26,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:26,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:26,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:26,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2023-11-21 22:18:26,089 INFO L748 eck$LassoCheckResult]: Stem: 2215#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 2201#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2202#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 2205#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2206#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2207#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2208#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2220#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2226#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2225#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2224#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2223#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2203#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 2204#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2209#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2210#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 2219#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2211#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2212#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2243#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2244#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2239#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 2240#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2238#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2213#L515-2 [2023-11-21 22:18:26,090 INFO L750 eck$LassoCheckResult]: Loop: 2213#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 2214#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2237#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2227#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2222#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2233#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2234#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2217#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2218#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2213#L515-2 [2023-11-21 22:18:26,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:26,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1064655528, now seen corresponding path program 3 times [2023-11-21 22:18:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:26,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978663011] [2023-11-21 22:18:26,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:26,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:26,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:26,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:26,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:26,127 INFO L85 PathProgramCache]: Analyzing trace with hash -683362729, now seen corresponding path program 8 times [2023-11-21 22:18:26,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:26,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482963849] [2023-11-21 22:18:26,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:26,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:26,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:26,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:26,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1495099280, now seen corresponding path program 3 times [2023-11-21 22:18:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:26,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474981114] [2023-11-21 22:18:26,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:26,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:28,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:28,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474981114] [2023-11-21 22:18:28,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474981114] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:28,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616200570] [2023-11-21 22:18:28,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:18:28,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:28,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:28,236 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:28,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2023-11-21 22:18:28,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-21 22:18:28,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:18:28,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-21 22:18:28,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:28,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:18:28,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 25 [2023-11-21 22:18:28,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:18:28,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 25 [2023-11-21 22:18:28,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:18:28,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-11-21 22:18:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-21 22:18:28,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:29,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 88 [2023-11-21 22:18:29,326 INFO L349 Elim1Store]: treesize reduction 13, result has 75.5 percent of original size [2023-11-21 22:18:29,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 756 treesize of output 538 [2023-11-21 22:18:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 11 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-21 22:18:29,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616200570] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:29,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:29,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 11] total 38 [2023-11-21 22:18:29,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189661190] [2023-11-21 22:18:29,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:29,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:29,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-21 22:18:29,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1245, Unknown=0, NotChecked=0, Total=1406 [2023-11-21 22:18:29,798 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. cyclomatic complexity: 16 Second operand has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 38 states have internal predecessors, (74), 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-21 22:18:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:32,553 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2023-11-21 22:18:32,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 169 transitions. [2023-11-21 22:18:32,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 83 [2023-11-21 22:18:32,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 169 transitions. [2023-11-21 22:18:32,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2023-11-21 22:18:32,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2023-11-21 22:18:32,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 169 transitions. [2023-11-21 22:18:32,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:32,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 132 states and 169 transitions. [2023-11-21 22:18:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 169 transitions. [2023-11-21 22:18:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 97. [2023-11-21 22:18:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 96 states have internal predecessors, (133), 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-21 22:18:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2023-11-21 22:18:32,564 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 133 transitions. [2023-11-21 22:18:32,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 22:18:32,565 INFO L428 stractBuchiCegarLoop]: Abstraction has 97 states and 133 transitions. [2023-11-21 22:18:32,565 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-21 22:18:32,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 133 transitions. [2023-11-21 22:18:32,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2023-11-21 22:18:32,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:32,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:32,567 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:32,567 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2023-11-21 22:18:32,567 INFO L748 eck$LassoCheckResult]: Stem: 2718#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2719#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 2703#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2704#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 2707#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2708#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2709#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2710#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2724#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2731#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2730#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2729#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2728#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2705#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 2706#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2732#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2733#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2746#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2742#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2743#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2776#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2775#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2774#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2741#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2766#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2762#L515-2 [2023-11-21 22:18:32,567 INFO L750 eck$LassoCheckResult]: Loop: 2762#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 2761#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2711#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2712#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2720#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2721#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2770#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2768#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2764#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2762#L515-2 [2023-11-21 22:18:32,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:32,568 INFO L85 PathProgramCache]: Analyzing trace with hash 384595236, now seen corresponding path program 1 times [2023-11-21 22:18:32,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:32,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675103075] [2023-11-21 22:18:32,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:32,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:32,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:32,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:32,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:32,609 INFO L85 PathProgramCache]: Analyzing trace with hash -683362729, now seen corresponding path program 9 times [2023-11-21 22:18:32,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:32,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954511063] [2023-11-21 22:18:32,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:32,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:32,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:32,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:32,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:32,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1063888748, now seen corresponding path program 3 times [2023-11-21 22:18:32,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:32,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656679436] [2023-11-21 22:18:32,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:32,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:32,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:32,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:35,618 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:18:35,618 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:18:35,619 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:18:35,619 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:18:35,619 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:18:35,619 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:35,619 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:18:35,619 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:18:35,619 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration15_Lasso [2023-11-21 22:18:35,619 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:18:35,619 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:18:35,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:35,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:35,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:35,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:35,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:35,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:18:36,801 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:18:36,801 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:18:36,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:36,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:36,803 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:36,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-11-21 22:18:36,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:36,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:36,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:36,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:36,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:36,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:36,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:36,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:36,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:36,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:36,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:36,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:36,832 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:36,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-11-21 22:18:36,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:36,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:36,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:36,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:36,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:36,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:36,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:36,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:36,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:36,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:36,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:36,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:36,859 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:36,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-11-21 22:18:36,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:36,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:36,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:36,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:36,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:36,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:36,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:36,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:36,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:36,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2023-11-21 22:18:36,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:36,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:36,886 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:36,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-11-21 22:18:36,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:36,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:36,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:36,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:36,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:36,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:36,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:36,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:36,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:36,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:36,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:36,915 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:36,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-11-21 22:18:36,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:18:36,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:36,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:18:36,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:36,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:36,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:36,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:18:36,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:18:36,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:18:36,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2023-11-21 22:18:36,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:36,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:36,940 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:36,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-11-21 22:18:36,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 22:18:36,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:18:36,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:18:36,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:18:36,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:18:36,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:18:36,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:18:36,987 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:18:37,032 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2023-11-21 22:18:37,033 INFO L444 ModelExtractionUtils]: 4 out of 28 variables were initially zero. Simplification set additionally 19 variables to zero. [2023-11-21 22:18:37,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:18:37,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:37,034 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:37,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-11-21 22:18:37,035 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:18:37,046 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-21 22:18:37,046 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:18:37,046 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~numbers~0#1.base) (+ 8 ULTIMATE.start_main_~numbers~0#1.offset))_1, v_rep(select (select #memory_int#0 ULTIMATE.start_sort_~x#1.base) (+ 12 ULTIMATE.start_sort_~x#1.offset))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~numbers~0#1.base) (+ 8 ULTIMATE.start_main_~numbers~0#1.offset))_1 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_sort_~x#1.base) (+ 12 ULTIMATE.start_sort_~x#1.offset))_1 Supporting invariants [-1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~numbers~0#1.base) ULTIMATE.start_main_~numbers~0#1.offset)_2 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_sort_~x#1.base) (+ 12 ULTIMATE.start_sort_~x#1.offset))_1 >= 0] [2023-11-21 22:18:37,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2023-11-21 22:18:37,124 INFO L156 tatePredicateManager]: 10 out of 13 supporting invariants were superfluous and have been removed [2023-11-21 22:18:37,130 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#0[~x!base][12 + ~x!offset] could not be translated [2023-11-21 22:18:37,131 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#0[~numbers~0!base][8 + ~numbers~0!offset] could not be translated [2023-11-21 22:18:37,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:37,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-21 22:18:37,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:37,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:18:37,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2023-11-21 22:18:37,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-11-21 22:18:37,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:18:37,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:18:37,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2023-11-21 22:18:37,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:18:37,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:18:37,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2023-11-21 22:18:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:37,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-21 22:18:37,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:37,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:18:37,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:18:37,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:18:37,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 48 [2023-11-21 22:18:38,032 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:18:38,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:18:38,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:18:38,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:18:38,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 53 [2023-11-21 22:18:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:38,107 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 7 loop predicates [2023-11-21 22:18:38,107 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 133 transitions. cyclomatic complexity: 41 Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 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-21 22:18:38,615 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 133 transitions. cyclomatic complexity: 41. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 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 237 states and 318 transitions. Complement of second has 27 states. [2023-11-21 22:18:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 10 stem states 7 non-accepting loop states 2 accepting loop states [2023-11-21 22:18:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 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-21 22:18:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 57 transitions. [2023-11-21 22:18:38,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 57 transitions. Stem has 25 letters. Loop has 9 letters. [2023-11-21 22:18:38,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:38,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 57 transitions. Stem has 34 letters. Loop has 9 letters. [2023-11-21 22:18:38,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:38,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 57 transitions. Stem has 25 letters. Loop has 18 letters. [2023-11-21 22:18:38,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:18:38,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 237 states and 318 transitions. [2023-11-21 22:18:38,621 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 100 [2023-11-21 22:18:38,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 237 states to 192 states and 259 transitions. [2023-11-21 22:18:38,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2023-11-21 22:18:38,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2023-11-21 22:18:38,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 259 transitions. [2023-11-21 22:18:38,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:18:38,625 INFO L218 hiAutomatonCegarLoop]: Abstraction has 192 states and 259 transitions. [2023-11-21 22:18:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 259 transitions. [2023-11-21 22:18:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 132. [2023-11-21 22:18:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.356060606060606) internal successors, (179), 131 states have internal predecessors, (179), 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-21 22:18:38,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 179 transitions. [2023-11-21 22:18:38,634 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 179 transitions. [2023-11-21 22:18:38,634 INFO L428 stractBuchiCegarLoop]: Abstraction has 132 states and 179 transitions. [2023-11-21 22:18:38,634 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-11-21 22:18:38,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 179 transitions. [2023-11-21 22:18:38,636 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 65 [2023-11-21 22:18:38,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:38,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:38,637 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:38,637 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1] [2023-11-21 22:18:38,637 INFO L748 eck$LassoCheckResult]: Stem: 3291#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 3271#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3272#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 3275#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3276#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3277#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3278#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3297#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3306#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3305#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3304#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3303#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3273#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 3274#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 3322#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3320#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3319#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3318#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3316#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3315#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3314#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3312#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 3313#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3368#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 3283#L515-2 [2023-11-21 22:18:38,637 INFO L750 eck$LassoCheckResult]: Loop: 3283#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 3284#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 3354#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3359#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 3385#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3383#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3382#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3381#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3380#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 3283#L515-2 [2023-11-21 22:18:38,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash 384597158, now seen corresponding path program 4 times [2023-11-21 22:18:38,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:38,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074134275] [2023-11-21 22:18:38,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:38,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:38,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:38,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:38,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:38,682 INFO L85 PathProgramCache]: Analyzing trace with hash -626104427, now seen corresponding path program 1 times [2023-11-21 22:18:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:38,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038068242] [2023-11-21 22:18:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:38,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:38,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:38,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:38,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash -748465008, now seen corresponding path program 4 times [2023-11-21 22:18:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:38,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866643945] [2023-11-21 22:18:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:38,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:39,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:39,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866643945] [2023-11-21 22:18:39,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866643945] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:39,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919422070] [2023-11-21 22:18:39,742 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 22:18:39,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:39,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:39,743 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:39,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2023-11-21 22:18:39,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 22:18:39,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:18:39,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-21 22:18:39,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:39,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:18:39,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 24 [2023-11-21 22:18:40,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:18:40,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2023-11-21 22:18:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-21 22:18:40,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:40,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 88 [2023-11-21 22:18:40,273 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-11-21 22:18:40,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 672 treesize of output 431 [2023-11-21 22:18:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-21 22:18:40,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919422070] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:40,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:40,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 30 [2023-11-21 22:18:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304266817] [2023-11-21 22:18:40,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:40,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:40,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-21 22:18:40,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2023-11-21 22:18:40,492 INFO L87 Difference]: Start difference. First operand 132 states and 179 transitions. cyclomatic complexity: 57 Second operand has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 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-21 22:18:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:41,909 INFO L93 Difference]: Finished difference Result 245 states and 325 transitions. [2023-11-21 22:18:41,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 325 transitions. [2023-11-21 22:18:41,911 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 155 [2023-11-21 22:18:41,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 245 states and 325 transitions. [2023-11-21 22:18:41,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2023-11-21 22:18:41,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2023-11-21 22:18:41,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 325 transitions. [2023-11-21 22:18:41,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:18:41,915 INFO L218 hiAutomatonCegarLoop]: Abstraction has 245 states and 325 transitions. [2023-11-21 22:18:41,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 325 transitions. [2023-11-21 22:18:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 181. [2023-11-21 22:18:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 181 states have (on average 1.3756906077348066) internal successors, (249), 180 states have internal predecessors, (249), 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-21 22:18:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 249 transitions. [2023-11-21 22:18:41,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 181 states and 249 transitions. [2023-11-21 22:18:41,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-21 22:18:41,926 INFO L428 stractBuchiCegarLoop]: Abstraction has 181 states and 249 transitions. [2023-11-21 22:18:41,926 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-11-21 22:18:41,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states and 249 transitions. [2023-11-21 22:18:41,928 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 108 [2023-11-21 22:18:41,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:41,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:41,929 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:41,929 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 2, 2, 2] [2023-11-21 22:18:41,930 INFO L748 eck$LassoCheckResult]: Stem: 3942#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3943#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 3930#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3931#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 3934#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3935#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3936#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3937#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3955#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3962#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3961#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3960#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3959#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3932#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 3933#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 3981#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3979#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3978#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3977#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3975#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3974#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3973#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3971#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 3972#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4042#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 4011#L515-2 [2023-11-21 22:18:41,930 INFO L750 eck$LassoCheckResult]: Loop: 4011#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 4010#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 3938#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3939#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4018#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4088#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4089#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 4005#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4103#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 3996#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 4059#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 4060#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4071#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 4046#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4070#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4004#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4003#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4013#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 4011#L515-2 [2023-11-21 22:18:41,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash 384597158, now seen corresponding path program 5 times [2023-11-21 22:18:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427360494] [2023-11-21 22:18:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:41,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:41,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:41,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:41,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1181072573, now seen corresponding path program 2 times [2023-11-21 22:18:41,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:41,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662769566] [2023-11-21 22:18:41,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:42,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:42,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662769566] [2023-11-21 22:18:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662769566] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:42,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864535492] [2023-11-21 22:18:42,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:18:42,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:42,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:42,054 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:42,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2023-11-21 22:18:42,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:18:42,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:18:42,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 22:18:42,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:42,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:42,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864535492] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:42,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:42,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-11-21 22:18:42,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623113661] [2023-11-21 22:18:42,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:42,271 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:18:42,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:42,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 22:18:42,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-21 22:18:42,272 INFO L87 Difference]: Start difference. First operand 181 states and 249 transitions. cyclomatic complexity: 79 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-21 22:18:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:42,363 INFO L93 Difference]: Finished difference Result 278 states and 360 transitions. [2023-11-21 22:18:42,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 360 transitions. [2023-11-21 22:18:42,367 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2023-11-21 22:18:42,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 264 states and 344 transitions. [2023-11-21 22:18:42,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2023-11-21 22:18:42,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2023-11-21 22:18:42,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 264 states and 344 transitions. [2023-11-21 22:18:42,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:18:42,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 264 states and 344 transitions. [2023-11-21 22:18:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states and 344 transitions. [2023-11-21 22:18:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 181. [2023-11-21 22:18:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 181 states have (on average 1.3867403314917126) internal successors, (251), 180 states have internal predecessors, (251), 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-21 22:18:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 251 transitions. [2023-11-21 22:18:42,378 INFO L240 hiAutomatonCegarLoop]: Abstraction has 181 states and 251 transitions. [2023-11-21 22:18:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:18:42,380 INFO L428 stractBuchiCegarLoop]: Abstraction has 181 states and 251 transitions. [2023-11-21 22:18:42,381 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-11-21 22:18:42,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states and 251 transitions. [2023-11-21 22:18:42,382 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 109 [2023-11-21 22:18:42,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:42,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:42,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:42,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 2, 2, 2] [2023-11-21 22:18:42,385 INFO L748 eck$LassoCheckResult]: Stem: 4529#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4530#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 4517#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4518#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 4521#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 4522#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4523#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 4524#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4555#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 4554#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4551#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 4544#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4543#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4519#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 4520#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 4566#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4564#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4563#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4562#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4560#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4559#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4558#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4556#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 4557#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4600#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 4601#L515-2 [2023-11-21 22:18:42,386 INFO L750 eck$LassoCheckResult]: Loop: 4601#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 4668#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 4667#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4666#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4583#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4581#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4582#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 4609#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4688#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4619#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4602#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4615#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 4614#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 4613#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 4612#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4611#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 4585#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4692#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4691#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4690#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4689#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4640#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 4630#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4639#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 4601#L515-2 [2023-11-21 22:18:42,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:42,386 INFO L85 PathProgramCache]: Analyzing trace with hash 384597158, now seen corresponding path program 6 times [2023-11-21 22:18:42,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:42,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082287795] [2023-11-21 22:18:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:42,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:42,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:42,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:42,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:42,441 INFO L85 PathProgramCache]: Analyzing trace with hash -322794479, now seen corresponding path program 3 times [2023-11-21 22:18:42,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:42,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757047195] [2023-11-21 22:18:42,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:42,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757047195] [2023-11-21 22:18:42,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757047195] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:42,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990488195] [2023-11-21 22:18:42,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:18:42,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:42,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:42,577 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:42,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2023-11-21 22:18:42,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-21 22:18:42,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:18:42,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-21 22:18:42,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:42,790 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:42,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990488195] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:42,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:42,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 14 [2023-11-21 22:18:42,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590379907] [2023-11-21 22:18:42,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:42,874 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:18:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-21 22:18:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-21 22:18:42,875 INFO L87 Difference]: Start difference. First operand 181 states and 251 transitions. cyclomatic complexity: 80 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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-21 22:18:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:43,106 INFO L93 Difference]: Finished difference Result 328 states and 442 transitions. [2023-11-21 22:18:43,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 328 states and 442 transitions. [2023-11-21 22:18:43,111 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 136 [2023-11-21 22:18:43,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 328 states to 327 states and 441 transitions. [2023-11-21 22:18:43,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2023-11-21 22:18:43,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 [2023-11-21 22:18:43,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 327 states and 441 transitions. [2023-11-21 22:18:43,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:18:43,118 INFO L218 hiAutomatonCegarLoop]: Abstraction has 327 states and 441 transitions. [2023-11-21 22:18:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states and 441 transitions. [2023-11-21 22:18:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 249. [2023-11-21 22:18:43,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 249 states have (on average 1.3855421686746987) internal successors, (345), 248 states have internal predecessors, (345), 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-21 22:18:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 345 transitions. [2023-11-21 22:18:43,128 INFO L240 hiAutomatonCegarLoop]: Abstraction has 249 states and 345 transitions. [2023-11-21 22:18:43,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 22:18:43,130 INFO L428 stractBuchiCegarLoop]: Abstraction has 249 states and 345 transitions. [2023-11-21 22:18:43,130 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-11-21 22:18:43,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 345 transitions. [2023-11-21 22:18:43,131 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 123 [2023-11-21 22:18:43,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:43,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:43,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:43,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 1, 1, 1] [2023-11-21 22:18:43,136 INFO L748 eck$LassoCheckResult]: Stem: 5221#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5222#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 5203#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5204#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 5207#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5208#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5209#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5210#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5227#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5241#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5238#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5232#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5231#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5205#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 5206#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 5268#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5266#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5265#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5264#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5262#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5261#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5260#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5258#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5257#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5255#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5240#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5254#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5327#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 5324#L515-2 [2023-11-21 22:18:43,136 INFO L750 eck$LassoCheckResult]: Loop: 5324#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 5323#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 5322#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5319#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5318#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5317#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5315#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5314#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5311#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5313#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5330#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5337#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5326#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5308#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5325#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 5324#L515-2 [2023-11-21 22:18:43,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1495968645, now seen corresponding path program 2 times [2023-11-21 22:18:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:43,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216650474] [2023-11-21 22:18:43,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:43,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:43,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:43,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216650474] [2023-11-21 22:18:43,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216650474] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:43,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385552462] [2023-11-21 22:18:43,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:18:43,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:43,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:43,403 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:43,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2023-11-21 22:18:43,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:18:43,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:18:43,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-21 22:18:43,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:43,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:43,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385552462] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:43,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:43,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2023-11-21 22:18:43,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054454052] [2023-11-21 22:18:43,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:43,835 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:18:43,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1330319177, now seen corresponding path program 10 times [2023-11-21 22:18:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:43,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370845504] [2023-11-21 22:18:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:43,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:43,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:43,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:44,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-21 22:18:44,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2023-11-21 22:18:44,729 INFO L87 Difference]: Start difference. First operand 249 states and 345 transitions. cyclomatic complexity: 106 Second operand has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 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-21 22:18:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:45,078 INFO L93 Difference]: Finished difference Result 325 states and 436 transitions. [2023-11-21 22:18:45,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 436 transitions. [2023-11-21 22:18:45,080 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 129 [2023-11-21 22:18:45,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 325 states and 436 transitions. [2023-11-21 22:18:45,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2023-11-21 22:18:45,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2023-11-21 22:18:45,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 325 states and 436 transitions. [2023-11-21 22:18:45,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:18:45,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 325 states and 436 transitions. [2023-11-21 22:18:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states and 436 transitions. [2023-11-21 22:18:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 278. [2023-11-21 22:18:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 278 states have (on average 1.370503597122302) internal successors, (381), 277 states have internal predecessors, (381), 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-21 22:18:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 381 transitions. [2023-11-21 22:18:45,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 278 states and 381 transitions. [2023-11-21 22:18:45,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:18:45,094 INFO L428 stractBuchiCegarLoop]: Abstraction has 278 states and 381 transitions. [2023-11-21 22:18:45,095 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2023-11-21 22:18:45,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 278 states and 381 transitions. [2023-11-21 22:18:45,096 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 123 [2023-11-21 22:18:45,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:45,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:45,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:45,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1] [2023-11-21 22:18:45,098 INFO L748 eck$LassoCheckResult]: Stem: 6002#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6003#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 5990#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5991#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 5994#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5995#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5996#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5997#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6014#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 6059#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6058#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 6057#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6054#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 6055#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6056#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6053#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 6052#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 6051#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6049#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 6047#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6045#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6042#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 6040#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6037#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6034#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 6032#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6029#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6023#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 6026#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6132#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 6129#L515-2 [2023-11-21 22:18:45,098 INFO L750 eck$LassoCheckResult]: Loop: 6129#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 6128#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 6127#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6124#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 6123#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6122#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6120#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 6119#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6118#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6116#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 6115#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6107#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6109#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 6136#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6130#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 6129#L515-2 [2023-11-21 22:18:45,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:45,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1214049117, now seen corresponding path program 3 times [2023-11-21 22:18:45,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:45,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225497803] [2023-11-21 22:18:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:45,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:45,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:45,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:45,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:45,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1273060875, now seen corresponding path program 4 times [2023-11-21 22:18:45,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:45,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907816400] [2023-11-21 22:18:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:45,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:45,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:45,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash 525996825, now seen corresponding path program 5 times [2023-11-21 22:18:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:45,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727369178] [2023-11-21 22:18:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:45,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 42 proven. 63 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-21 22:18:45,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:45,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727369178] [2023-11-21 22:18:45,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727369178] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:45,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752049213] [2023-11-21 22:18:45,642 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 22:18:45,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:45,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:45,645 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:45,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2023-11-21 22:18:46,345 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-11-21 22:18:46,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:18:46,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 22:18:46,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-21 22:18:46,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-21 22:18:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752049213] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:46,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:46,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 26 [2023-11-21 22:18:46,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616862868] [2023-11-21 22:18:46,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:47,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:47,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-21 22:18:47,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2023-11-21 22:18:47,307 INFO L87 Difference]: Start difference. First operand 278 states and 381 transitions. cyclomatic complexity: 113 Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 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-21 22:18:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:48,019 INFO L93 Difference]: Finished difference Result 676 states and 908 transitions. [2023-11-21 22:18:48,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 676 states and 908 transitions. [2023-11-21 22:18:48,025 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 166 [2023-11-21 22:18:48,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 676 states to 676 states and 908 transitions. [2023-11-21 22:18:48,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 513 [2023-11-21 22:18:48,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 536 [2023-11-21 22:18:48,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 676 states and 908 transitions. [2023-11-21 22:18:48,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:18:48,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 676 states and 908 transitions. [2023-11-21 22:18:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states and 908 transitions. [2023-11-21 22:18:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 429. [2023-11-21 22:18:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 429 states have (on average 1.393939393939394) internal successors, (598), 428 states have internal predecessors, (598), 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-21 22:18:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 598 transitions. [2023-11-21 22:18:48,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 429 states and 598 transitions. [2023-11-21 22:18:48,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 22:18:48,050 INFO L428 stractBuchiCegarLoop]: Abstraction has 429 states and 598 transitions. [2023-11-21 22:18:48,050 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2023-11-21 22:18:48,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 598 transitions. [2023-11-21 22:18:48,052 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 144 [2023-11-21 22:18:48,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:48,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:48,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:48,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:18:48,054 INFO L748 eck$LassoCheckResult]: Stem: 7323#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7324#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 7305#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 7306#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 7309#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 7310#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7311#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 7312#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7329#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 7387#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7386#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 7385#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7381#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 7307#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 7308#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 7412#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 7413#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 7414#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 7408#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 7409#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 7442#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 7441#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 7437#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 7438#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 7448#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 7364#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 7447#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 7717#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 7456#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 7457#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 7452#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 7321#L515-2 [2023-11-21 22:18:48,054 INFO L750 eck$LassoCheckResult]: Loop: 7321#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 7317#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 7318#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 7330#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 7325#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 7326#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 7321#L515-2 [2023-11-21 22:18:48,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash 914001835, now seen corresponding path program 4 times [2023-11-21 22:18:48,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:48,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523443938] [2023-11-21 22:18:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:48,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-21 22:18:48,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:48,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523443938] [2023-11-21 22:18:48,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523443938] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:18:48,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84456843] [2023-11-21 22:18:48,239 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 22:18:48,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:18:48,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:48,243 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:18:48,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9ecfc5-9c6c-48b9-8e3e-23d59994eada/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2023-11-21 22:18:48,372 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 22:18:48,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:18:48,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 22:18:48,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-21 22:18:48,480 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:18:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-21 22:18:48,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84456843] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:18:48,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:18:48,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 17 [2023-11-21 22:18:48,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906260209] [2023-11-21 22:18:48,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:18:48,583 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:18:48,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1946171318, now seen corresponding path program 2 times [2023-11-21 22:18:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:48,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394022013] [2023-11-21 22:18:48,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:48,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:48,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:48,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:48,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-21 22:18:48,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-11-21 22:18:48,709 INFO L87 Difference]: Start difference. First operand 429 states and 598 transitions. cyclomatic complexity: 184 Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 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-21 22:18:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:18:49,038 INFO L93 Difference]: Finished difference Result 453 states and 612 transitions. [2023-11-21 22:18:49,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 453 states and 612 transitions. [2023-11-21 22:18:49,041 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 144 [2023-11-21 22:18:49,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 453 states to 453 states and 612 transitions. [2023-11-21 22:18:49,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 326 [2023-11-21 22:18:49,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 326 [2023-11-21 22:18:49,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 453 states and 612 transitions. [2023-11-21 22:18:49,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:18:49,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 453 states and 612 transitions. [2023-11-21 22:18:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states and 612 transitions. [2023-11-21 22:18:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 428. [2023-11-21 22:18:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 428 states have (on average 1.3668224299065421) internal successors, (585), 427 states have internal predecessors, (585), 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-21 22:18:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 585 transitions. [2023-11-21 22:18:49,058 INFO L240 hiAutomatonCegarLoop]: Abstraction has 428 states and 585 transitions. [2023-11-21 22:18:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:18:49,059 INFO L428 stractBuchiCegarLoop]: Abstraction has 428 states and 585 transitions. [2023-11-21 22:18:49,059 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2023-11-21 22:18:49,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 428 states and 585 transitions. [2023-11-21 22:18:49,062 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 144 [2023-11-21 22:18:49,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:18:49,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:18:49,063 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:49,063 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:18:49,063 INFO L748 eck$LassoCheckResult]: Stem: 8434#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8435#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 8416#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 8417#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 8420#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 8421#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8422#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 8423#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8440#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 8497#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8496#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 8495#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8494#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 8418#L528-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 8419#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 8555#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 8553#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 8552#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 8551#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 8549#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 8546#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 8544#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 8541#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 8542#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 8529#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 8466#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 8583#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 8839#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 8837#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 8514#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 8432#L516-3 [2023-11-21 22:18:49,063 INFO L750 eck$LassoCheckResult]: Loop: 8432#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 8589#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 8585#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 8584#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 8428#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 8429#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 8432#L516-3 [2023-11-21 22:18:49,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1137862586, now seen corresponding path program 5 times [2023-11-21 22:18:49,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:49,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847304931] [2023-11-21 22:18:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:49,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:49,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:49,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:49,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2046083018, now seen corresponding path program 3 times [2023-11-21 22:18:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649092612] [2023-11-21 22:18:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:49,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:49,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:18:49,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash -193021757, now seen corresponding path program 6 times [2023-11-21 22:18:49,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:49,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336896887] [2023-11-21 22:18:49,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:49,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:49,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:18:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:18:49,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace