./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer --witnessprinter.witness.filename witness.graphml --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 862be090098a4271d6e1a31a6f1302665ccfc795 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 03:11:05,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:11:05,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:11:05,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:11:05,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:11:05,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:11:05,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:11:05,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:11:05,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:11:05,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:11:05,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:11:05,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:11:05,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:11:05,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:11:05,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:11:05,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:11:05,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:11:05,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:11:05,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:11:05,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:11:05,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:11:05,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:11:05,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:11:05,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:11:05,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:11:05,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:11:05,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:11:05,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:11:05,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:11:05,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:11:05,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:11:05,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:11:05,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:11:05,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:11:05,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:11:05,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:11:05,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:11:05,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:11:05,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:11:05,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:11:05,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:11:05,528 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:11:05,565 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:11:05,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:11:05,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:11:05,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:11:05,567 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:11:05,567 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:11:05,567 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:11:05,568 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:11:05,568 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:11:05,568 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:11:05,568 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:11:05,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:11:05,569 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:11:05,569 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:11:05,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:11:05,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:11:05,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:11:05,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:11:05,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:11:05,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:11:05,571 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:11:05,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:11:05,571 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:11:05,571 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:11:05,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:11:05,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:11:05,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:11:05,572 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:11:05,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:11:05,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:11:05,573 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:11:05,573 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:11:05,575 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:11:05,575 INFO L138 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-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/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-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 862be090098a4271d6e1a31a6f1302665ccfc795 [2020-11-28 03:11:05,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:11:05,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:11:05,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:11:05,921 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:11:05,921 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:11:05,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2020-11-28 03:11:06,021 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/data/970996a06/69a4837ee03d48be982a78151e0e3ef8/FLAGdeeaeff61 [2020-11-28 03:11:06,636 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:11:06,637 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2020-11-28 03:11:06,654 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/data/970996a06/69a4837ee03d48be982a78151e0e3ef8/FLAGdeeaeff61 [2020-11-28 03:11:06,943 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/data/970996a06/69a4837ee03d48be982a78151e0e3ef8 [2020-11-28 03:11:06,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:11:06,948 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:11:06,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:11:06,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:11:06,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:11:06,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:11:06" (1/1) ... [2020-11-28 03:11:06,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b178f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:06, skipping insertion in model container [2020-11-28 03:11:06,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:11:06" (1/1) ... [2020-11-28 03:11:06,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:11:07,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:11:07,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:11:07,389 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:11:07,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:11:07,548 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:11:07,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:07 WrapperNode [2020-11-28 03:11:07,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:11:07,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:11:07,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:11:07,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:11:07,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:07" (1/1) ... [2020-11-28 03:11:07,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:07" (1/1) ... [2020-11-28 03:11:07,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:11:07,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:11:07,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:11:07,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:11:07,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:07" (1/1) ... [2020-11-28 03:11:07,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:07" (1/1) ... [2020-11-28 03:11:07,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:07" (1/1) ... [2020-11-28 03:11:07,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:07" (1/1) ... [2020-11-28 03:11:07,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:07" (1/1) ... [2020-11-28 03:11:07,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:07" (1/1) ... [2020-11-28 03:11:07,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:07" (1/1) ... [2020-11-28 03:11:07,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:11:07,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:11:07,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:11:07,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:11:07,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-28 03:11:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:11:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:11:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:11:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:11:07,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:11:08,083 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:11:08,084 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-28 03:11:08,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:11:08 BoogieIcfgContainer [2020-11-28 03:11:08,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:11:08,103 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:11:08,103 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:11:08,118 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:11:08,119 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:11:08,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:11:06" (1/3) ... [2020-11-28 03:11:08,121 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54ea7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:11:08, skipping insertion in model container [2020-11-28 03:11:08,121 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:11:08,121 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:07" (2/3) ... [2020-11-28 03:11:08,121 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54ea7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:11:08, skipping insertion in model container [2020-11-28 03:11:08,122 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:11:08,122 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:11:08" (3/3) ... [2020-11-28 03:11:08,123 INFO L373 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2020-11-28 03:11:08,207 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:11:08,207 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:11:08,207 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:11:08,207 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:11:08,208 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:11:08,208 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:11:08,208 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:11:08,208 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:11:08,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-11-28 03:11:08,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-28 03:11:08,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:11:08,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:11:08,307 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-28 03:11:08,307 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 03:11:08,307 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:11:08,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-11-28 03:11:08,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-28 03:11:08,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:11:08,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:11:08,313 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-28 03:11:08,313 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 03:11:08,324 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 9#L523true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 14#L523-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 4#L528-3true [2020-11-28 03:11:08,324 INFO L796 eck$LassoCheckResult]: Loop: 4#L528-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 3#L528-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 4#L528-3true [2020-11-28 03:11:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:08,341 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-11-28 03:11:08,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:08,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002111824] [2020-11-28 03:11:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:08,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:08,514 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:08,540 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:08,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:08,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-11-28 03:11:08,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:08,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474835183] [2020-11-28 03:11:08,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:08,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:08,586 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:08,596 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:08,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:08,599 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-11-28 03:11:08,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:08,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226745776] [2020-11-28 03:11:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:08,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:08,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:08,661 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:08,969 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-11-28 03:11:09,067 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:11:09,068 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:11:09,068 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:11:09,068 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:11:09,068 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:11:09,068 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:09,069 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:11:09,069 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:11:09,069 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2020-11-28 03:11:09,069 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:11:09,070 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:11:09,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:09,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:09,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:09,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:09,260 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-11-28 03:11:09,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:09,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:09,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:09,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:09,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:09,713 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:11:09,719 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:11:09,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:09,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:09,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:09,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:09,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:09,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:09,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:09,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:09,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:09,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:09,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:09,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:09,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:09,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:09,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:09,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:09,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:09,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:09,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:09,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:09,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:09,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:09,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:09,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:11:09,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:11:09,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:09,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:09,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:09,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:09,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:09,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:09,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:09,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:09,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:09,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:09,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:09,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:09,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:09,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:09,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:09,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:09,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:09,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:09,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:11:10,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:10,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:10,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:10,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:10,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:10,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:11:10,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:11:10,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:11:10,134 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-11-28 03:11:10,134 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:11:10,139 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:10,143 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-28 03:11:10,143 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:11:10,144 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -2*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [-2*ULTIMATE.start_main_~array_size~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 >= 0] [2020-11-28 03:11:10,194 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-11-28 03:11:10,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-28 03:11:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:10,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-28 03:11:10,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:11:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:10,458 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-28 03:11:10,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:11:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:10,513 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-11-28 03:11:10,515 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2020-11-28 03:11:10,682 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 35 states and 53 transitions. Complement of second has 9 states. [2020-11-28 03:11:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-28 03:11:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-11-28 03:11:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2020-11-28 03:11:10,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-28 03:11:10,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:11:10,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2020-11-28 03:11:10,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:11:10,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2020-11-28 03:11:10,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:11:10,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2020-11-28 03:11:10,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-28 03:11:10,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2020-11-28 03:11:10,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 03:11:10,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-28 03:11:10,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-11-28 03:11:10,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:11:10,708 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-28 03:11:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-11-28 03:11:10,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-11-28 03:11:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-28 03:11:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-11-28 03:11:10,741 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-28 03:11:10,741 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-28 03:11:10,741 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:11:10,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-11-28 03:11:10,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-28 03:11:10,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:11:10,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:11:10,748 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-28 03:11:10,748 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 03:11:10,748 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 121#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 122#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 123#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 124#L528-3 assume !(main_~i~1 < main_~array_size~0); 128#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 131#L515-3 [2020-11-28 03:11:10,749 INFO L796 eck$LassoCheckResult]: Loop: 131#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 130#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 132#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 131#L515-3 [2020-11-28 03:11:10,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:10,750 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-11-28 03:11:10,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:10,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221847313] [2020-11-28 03:11:10,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:10,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221847313] [2020-11-28 03:11:10,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:10,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:11:10,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109623304] [2020-11-28 03:11:10,873 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:11:10,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:10,874 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2020-11-28 03:11:10,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:10,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224652284] [2020-11-28 03:11:10,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:10,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224652284] [2020-11-28 03:11:10,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:10,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:11:10,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617319317] [2020-11-28 03:11:10,910 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:11:10,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:10,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:11:10,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:11:10,914 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-11-28 03:11:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:10,943 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-11-28 03:11:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:11:10,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-11-28 03:11:10,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-28 03:11:10,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2020-11-28 03:11:10,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-11-28 03:11:10,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-11-28 03:11:10,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-11-28 03:11:10,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:11:10,947 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-28 03:11:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-11-28 03:11:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-28 03:11:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-28 03:11:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-11-28 03:11:10,949 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-28 03:11:10,949 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-28 03:11:10,949 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:11:10,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-11-28 03:11:10,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-28 03:11:10,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:11:10,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:11:10,950 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-28 03:11:10,950 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-11-28 03:11:10,950 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 157#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 158#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 159#L528-3 assume !(main_~i~1 < main_~array_size~0); 163#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 166#L515-3 [2020-11-28 03:11:10,951 INFO L796 eck$LassoCheckResult]: Loop: 166#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 167#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 168#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 164#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 165#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 169#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 166#L515-3 [2020-11-28 03:11:10,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:10,952 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2020-11-28 03:11:10,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:10,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518573560] [2020-11-28 03:11:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:10,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518573560] [2020-11-28 03:11:10,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:10,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:11:10,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961584310] [2020-11-28 03:11:10,996 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:11:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2020-11-28 03:11:10,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:10,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582292435] [2020-11-28 03:11:10,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:11,027 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:11,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:11,042 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:11,165 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-28 03:11:11,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:11,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:11:11,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:11:11,214 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-11-28 03:11:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:11,251 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-11-28 03:11:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:11:11,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2020-11-28 03:11:11,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-28 03:11:11,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2020-11-28 03:11:11,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-11-28 03:11:11,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-11-28 03:11:11,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-11-28 03:11:11,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:11:11,254 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-28 03:11:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-11-28 03:11:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-11-28 03:11:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-28 03:11:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-11-28 03:11:11,256 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-11-28 03:11:11,256 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-11-28 03:11:11,256 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:11:11,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-11-28 03:11:11,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-28 03:11:11,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:11:11,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:11:11,258 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:11,258 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-11-28 03:11:11,258 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 192#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 193#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 194#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 195#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 196#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 197#L528-3 assume !(main_~i~1 < main_~array_size~0); 199#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 202#L515-3 [2020-11-28 03:11:11,258 INFO L796 eck$LassoCheckResult]: Loop: 202#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 203#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 204#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 200#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 201#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 205#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 202#L515-3 [2020-11-28 03:11:11,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:11,259 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-11-28 03:11:11,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:11,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105569002] [2020-11-28 03:11:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:11,293 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:11,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:11,319 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:11,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2020-11-28 03:11:11,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:11,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936465685] [2020-11-28 03:11:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:11,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:11,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:11,360 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:11,361 INFO L82 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2020-11-28 03:11:11,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:11,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12245374] [2020-11-28 03:11:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:11,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12245374] [2020-11-28 03:11:11,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218292904] [2020-11-28 03:11:11,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:11:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:11,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-28 03:11:11,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:11:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 03:11:11,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:11:11,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-11-28 03:11:11,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143694545] [2020-11-28 03:11:11,821 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2020-11-28 03:11:11,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:11,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 03:11:11,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:11:11,897 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 11 states. [2020-11-28 03:11:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:12,173 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-11-28 03:11:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:11:12,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2020-11-28 03:11:12,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-28 03:11:12,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 20 transitions. [2020-11-28 03:11:12,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-11-28 03:11:12,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-11-28 03:11:12,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2020-11-28 03:11:12,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:11:12,180 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-11-28 03:11:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2020-11-28 03:11:12,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-11-28 03:11:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-28 03:11:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-11-28 03:11:12,182 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-11-28 03:11:12,182 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-11-28 03:11:12,182 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:11:12,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-11-28 03:11:12,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-28 03:11:12,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:11:12,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:11:12,189 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:12,189 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-11-28 03:11:12,191 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 290#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 291#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 292#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 293#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 294#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 295#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 297#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 305#L528-3 assume !(main_~i~1 < main_~array_size~0); 300#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 301#L515-3 [2020-11-28 03:11:12,191 INFO L796 eck$LassoCheckResult]: Loop: 301#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 302#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 303#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 298#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 299#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 304#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 301#L515-3 [2020-11-28 03:11:12,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:12,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2020-11-28 03:11:12,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:12,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615094055] [2020-11-28 03:11:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:12,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:12,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:12,249 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:12,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:12,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2020-11-28 03:11:12,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:12,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399221398] [2020-11-28 03:11:12,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:12,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:12,270 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:12,272 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:12,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2020-11-28 03:11:12,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:12,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771714933] [2020-11-28 03:11:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:12,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:12,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:12,341 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:12,454 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-28 03:11:12,784 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2020-11-28 03:11:12,919 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-11-28 03:11:12,922 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:11:12,922 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:11:12,922 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:11:12,922 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:11:12,922 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:11:12,922 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:12,922 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:11:12,922 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:11:12,922 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2020-11-28 03:11:12,922 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:11:12,922 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:11:12,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:12,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:12,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:12,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:12,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:12,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:12,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:12,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:12,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:12,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:12,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:13,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:13,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:13,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:13,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:13,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:13,186 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2020-11-28 03:11:13,433 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-11-28 03:11:13,778 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:11:13,778 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:13,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:13,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:13,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:13,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:13,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:13,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:13,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:13,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:13,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:11:13,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:13,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:13,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:13,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:13,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:13,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:11:13,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:13,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:13,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:13,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:13,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:13,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:13,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:13,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:13,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:13,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:13,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:13,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:13,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:13,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:13,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:13,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:13,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:13,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:13,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:13,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:13,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:13,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:13,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:13,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:13,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:13,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:11:13,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:11:13,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:11:14,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:14,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:14,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:14,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:14,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:14,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:14,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:14,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:11:14,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:14,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:14,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:14,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:14,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:14,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:14,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:14,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:14,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:14,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:14,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:14,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:14,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:14,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:14,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:14,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:11:14,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:14,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:14,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:14,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:14,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:14,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:11:14,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:11:14,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:14,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:14,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:14,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:14,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:14,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:14,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:14,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:14,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:14,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:14,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:14,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:14,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:14,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:14,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:14,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:14,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:14,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:14,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:14,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:14,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:14,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:14,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:14,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:14,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:14,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:14,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:14,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:14,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:11:14,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:11:14,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:14,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:14,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:14,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:14,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:14,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:14,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:14,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:14,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:11:14,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:14,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:14,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:14,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:14,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:11:14,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:11:14,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:14,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:14,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:14,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:14,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:14,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:14,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:14,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:14,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:14,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:14,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:14,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:14,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:14,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:11:14,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:11:14,601 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:11:14,653 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-11-28 03:11:14,653 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:11:14,660 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:14,664 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-28 03:11:14,664 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:11:14,664 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2020-11-28 03:11:14,704 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-11-28 03:11:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:14,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:11:14,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:11:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:14,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 03:11:14,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:11:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 03:11:14,797 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-28 03:11:14,797 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-11-28 03:11:14,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 28 transitions. Complement of second has 4 states. [2020-11-28 03:11:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-28 03:11:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 03:11:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2020-11-28 03:11:14,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2020-11-28 03:11:14,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:11:14,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2020-11-28 03:11:14,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:11:14,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2020-11-28 03:11:14,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:11:14,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2020-11-28 03:11:14,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:11:14,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2020-11-28 03:11:14,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 03:11:14,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-28 03:11:14,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2020-11-28 03:11:14,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:11:14,825 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-11-28 03:11:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2020-11-28 03:11:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-11-28 03:11:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-28 03:11:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-11-28 03:11:14,830 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-11-28 03:11:14,830 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-11-28 03:11:14,830 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-28 03:11:14,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-11-28 03:11:14,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:11:14,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:11:14,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:11:14,834 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:14,834 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 03:11:14,834 INFO L794 eck$LassoCheckResult]: Stem: 418#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 412#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 413#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 414#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 415#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 419#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 420#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 416#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 417#L528-3 assume !(main_~i~1 < main_~array_size~0); 425#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 426#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 422#L516-3 [2020-11-28 03:11:14,835 INFO L796 eck$LassoCheckResult]: Loop: 422#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 427#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 421#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 422#L516-3 [2020-11-28 03:11:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:14,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2020-11-28 03:11:14,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:14,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383163703] [2020-11-28 03:11:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:14,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:14,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:14,887 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:14,888 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2020-11-28 03:11:14,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:14,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050011540] [2020-11-28 03:11:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:14,902 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:14,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:14,913 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:14,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:14,915 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2020-11-28 03:11:14,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:14,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098736030] [2020-11-28 03:11:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:14,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:14,973 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:14,977 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:15,365 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2020-11-28 03:11:15,480 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-11-28 03:11:15,482 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:11:15,482 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:11:15,482 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:11:15,482 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:11:15,482 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:11:15,482 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:15,482 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:11:15,483 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:11:15,483 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2020-11-28 03:11:15,483 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:11:15,483 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:11:15,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,650 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2020-11-28 03:11:15,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:15,961 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2020-11-28 03:11:16,190 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:11:16,190 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:16,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:16,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:16,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:16,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:16,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:16,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:16,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:16,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:16,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:16,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:16,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:16,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:16,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:16,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:16,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:16,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:16,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:16,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:16,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:16,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:16,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:16,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:16,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:16,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:11:16,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:11:16,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:16,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:16,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:16,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:11:16,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:16,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:16,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:16,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:11:16,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:11:16,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:16,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:16,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:16,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:16,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:16,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:16,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:11:16,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:11:16,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:16,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:11:16,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:11:16,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:11:16,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:11:16,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:11:16,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:11:16,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:11:16,391 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:11:16,451 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-11-28 03:11:16,451 INFO L444 ModelExtractionUtils]: 25 out of 43 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:11:16,454 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:16,457 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-28 03:11:16,457 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:11:16,457 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, v_rep(select #length ULTIMATE.start_sort_~x.base)_2) = -1*ULTIMATE.start_sort_~x.offset - 4*ULTIMATE.start_sort_~i~0 + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_2 Supporting invariants [] [2020-11-28 03:11:16,512 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-11-28 03:11:16,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-28 03:11:16,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:16,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:11:16,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:11:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:16,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 03:11:16,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:11:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:16,595 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-28 03:11:16,596 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-11-28 03:11:16,620 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 36 states and 50 transitions. Complement of second has 7 states. [2020-11-28 03:11:16,621 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 [2020-11-28 03:11:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 03:11:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-11-28 03:11:16,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2020-11-28 03:11:16,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:11:16,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2020-11-28 03:11:16,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:11:16,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2020-11-28 03:11:16,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:11:16,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2020-11-28 03:11:16,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:11:16,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2020-11-28 03:11:16,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 03:11:16,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-28 03:11:16,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2020-11-28 03:11:16,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:11:16,625 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-11-28 03:11:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2020-11-28 03:11:16,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2020-11-28 03:11:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-28 03:11:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-11-28 03:11:16,627 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-11-28 03:11:16,627 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-11-28 03:11:16,627 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-28 03:11:16,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-11-28 03:11:16,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:11:16,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:11:16,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:11:16,628 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:16,628 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 03:11:16,629 INFO L794 eck$LassoCheckResult]: Stem: 564#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 558#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 559#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 560#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 561#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 562#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 563#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 565#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 577#L528-3 assume !(main_~i~1 < main_~array_size~0); 570#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 571#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 573#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 574#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 568#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 569#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 575#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 576#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 567#L516-3 [2020-11-28 03:11:16,629 INFO L796 eck$LassoCheckResult]: Loop: 567#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 572#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 566#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 567#L516-3 [2020-11-28 03:11:16,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:16,629 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2020-11-28 03:11:16,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:16,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927579844] [2020-11-28 03:11:16,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 03:11:16,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927579844] [2020-11-28 03:11:16,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418540768] [2020-11-28 03:11:16,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:11:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:16,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-28 03:11:16,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:11:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 03:11:16,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:11:16,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-11-28 03:11:16,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644953914] [2020-11-28 03:11:16,881 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:11:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:16,881 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2020-11-28 03:11:16,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:16,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924857192] [2020-11-28 03:11:16,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:16,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:16,890 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:16,900 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:16,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:16,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 03:11:16,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:11:16,993 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-11-28 03:11:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:17,097 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-11-28 03:11:17,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:11:17,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2020-11-28 03:11:17,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:11:17,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 28 transitions. [2020-11-28 03:11:17,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 03:11:17,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-28 03:11:17,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-11-28 03:11:17,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:11:17,100 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-11-28 03:11:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-11-28 03:11:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-11-28 03:11:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-28 03:11:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-11-28 03:11:17,102 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-11-28 03:11:17,102 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-11-28 03:11:17,102 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-28 03:11:17,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-11-28 03:11:17,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:11:17,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:11:17,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:11:17,104 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:17,104 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 03:11:17,104 INFO L794 eck$LassoCheckResult]: Stem: 683#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 677#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 678#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 679#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 680#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 681#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 682#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 698#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 684#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 685#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 697#L528-3 assume !(main_~i~1 < main_~array_size~0); 690#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 691#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 695#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 696#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 688#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 689#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 692#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 693#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 687#L516-3 [2020-11-28 03:11:17,104 INFO L796 eck$LassoCheckResult]: Loop: 687#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 694#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 686#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 687#L516-3 [2020-11-28 03:11:17,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:17,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2020-11-28 03:11:17,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:17,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131742553] [2020-11-28 03:11:17,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:17,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131742553] [2020-11-28 03:11:17,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053461657] [2020-11-28 03:11:17,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:11:17,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 03:11:17,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:11:17,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-28 03:11:17,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:11:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-28 03:11:17,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:11:17,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2020-11-28 03:11:17,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093579415] [2020-11-28 03:11:17,338 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:11:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2020-11-28 03:11:17,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:17,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906963162] [2020-11-28 03:11:17,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:17,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:17,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:17,348 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:17,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:17,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-28 03:11:17,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-11-28 03:11:17,470 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-11-28 03:11:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:17,791 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2020-11-28 03:11:17,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-28 03:11:17,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2020-11-28 03:11:17,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:11:17,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. [2020-11-28 03:11:17,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-11-28 03:11:17,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-28 03:11:17,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2020-11-28 03:11:17,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:11:17,794 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 56 transitions. [2020-11-28 03:11:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2020-11-28 03:11:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2020-11-28 03:11:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-28 03:11:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-11-28 03:11:17,796 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-11-28 03:11:17,796 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-11-28 03:11:17,796 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-28 03:11:17,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-11-28 03:11:17,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:11:17,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:11:17,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:11:17,797 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:17,797 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 03:11:17,797 INFO L794 eck$LassoCheckResult]: Stem: 840#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 834#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 835#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 836#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 837#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 838#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 839#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 841#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 856#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 855#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 854#L528-3 assume !(main_~i~1 < main_~array_size~0); 846#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 847#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 852#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 858#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 844#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 845#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 849#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 853#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 857#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 850#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 851#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 843#L516-3 [2020-11-28 03:11:17,797 INFO L796 eck$LassoCheckResult]: Loop: 843#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 848#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 842#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 843#L516-3 [2020-11-28 03:11:17,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:17,797 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2020-11-28 03:11:17,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:17,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212058008] [2020-11-28 03:11:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:17,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:17,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:17,823 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:17,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2020-11-28 03:11:17,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:17,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281587452] [2020-11-28 03:11:17,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:17,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:17,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:17,833 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:17,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2020-11-28 03:11:17,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:17,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010910323] [2020-11-28 03:11:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:18,080 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 03:11:18,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010910323] [2020-11-28 03:11:18,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283509891] [2020-11-28 03:11:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acdfe190-5433-486a-a28f-034ceb0055f0/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:11:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:18,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-28 03:11:18,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:11:18,363 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-28 03:11:18,363 INFO L384 Elim1Store]: Elim1 did not use preprocessing 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 [2020-11-28 03:11:18,365 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:11:18,386 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:11:18,386 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:11:18,387 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-11-28 03:11:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-28 03:11:18,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:11:18,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2020-11-28 03:11:18,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093712891] [2020-11-28 03:11:18,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:18,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-28 03:11:18,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-11-28 03:11:18,481 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 16 states. [2020-11-28 03:11:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:18,799 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2020-11-28 03:11:18,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-28 03:11:18,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2020-11-28 03:11:18,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-28 03:11:18,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2020-11-28 03:11:18,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-11-28 03:11:18,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-11-28 03:11:18,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2020-11-28 03:11:18,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:11:18,802 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2020-11-28 03:11:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2020-11-28 03:11:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2020-11-28 03:11:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-28 03:11:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2020-11-28 03:11:18,806 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-11-28 03:11:18,806 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-11-28 03:11:18,806 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-28 03:11:18,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2020-11-28 03:11:18,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:11:18,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:11:18,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:11:18,808 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:18,808 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 03:11:18,809 INFO L794 eck$LassoCheckResult]: Stem: 1018#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1012#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1013#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1014#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 1015#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1016#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1017#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1019#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1038#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1037#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1036#L528-3 assume !(main_~i~1 < main_~array_size~0); 1024#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 1025#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 1031#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1042#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 1022#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1023#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1028#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1034#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1041#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 1029#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 1030#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 1021#L516-3 [2020-11-28 03:11:18,809 INFO L796 eck$LassoCheckResult]: Loop: 1021#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1045#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1020#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1021#L516-3 [2020-11-28 03:11:18,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:18,809 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2020-11-28 03:11:18,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:18,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263679251] [2020-11-28 03:11:18,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:18,822 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:18,834 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:18,850 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:18,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2020-11-28 03:11:18,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:18,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848157762] [2020-11-28 03:11:18,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:18,855 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:18,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:18,862 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2020-11-28 03:11:18,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:18,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285315379] [2020-11-28 03:11:18,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:18,906 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:18,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:18,930 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:19,898 WARN L193 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 137 [2020-11-28 03:11:20,210 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-28 03:11:20,213 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:11:20,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:11:20,213 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:11:20,213 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:11:20,213 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:11:20,213 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:11:20,213 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:11:20,213 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:11:20,213 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration10_Lasso [2020-11-28 03:11:20,213 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:11:20,213 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:11:20,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:20,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:20,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:20,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:11:20,345 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 03:11:20,348 INFO L168 Benchmark]: Toolchain (without parser) took 13399.55 ms. Allocated memory was 92.3 MB in the beginning and 195.0 MB in the end (delta: 102.8 MB). Free memory was 59.6 MB in the beginning and 80.7 MB in the end (delta: -21.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:20,348 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 92.3 MB. Free memory was 51.5 MB in the beginning and 51.5 MB in the end (delta: 39.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:11:20,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.83 ms. Allocated memory is still 92.3 MB. Free memory was 59.4 MB in the beginning and 58.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:20,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.88 ms. Allocated memory is still 92.3 MB. Free memory was 58.4 MB in the beginning and 56.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:20,350 INFO L168 Benchmark]: Boogie Preprocessor took 31.36 ms. Allocated memory is still 92.3 MB. Free memory was 56.6 MB in the beginning and 55.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:20,350 INFO L168 Benchmark]: RCFGBuilder took 443.55 ms. Allocated memory is still 92.3 MB. Free memory was 55.3 MB in the beginning and 40.6 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:20,351 INFO L168 Benchmark]: BuchiAutomizer took 12243.97 ms. Allocated memory was 92.3 MB in the beginning and 195.0 MB in the end (delta: 102.8 MB). Free memory was 40.2 MB in the beginning and 80.7 MB in the end (delta: -40.5 MB). Peak memory consumption was 87.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:20,353 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 92.3 MB. Free memory was 51.5 MB in the beginning and 51.5 MB in the end (delta: 39.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 598.83 ms. Allocated memory is still 92.3 MB. Free memory was 59.4 MB in the beginning and 58.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.88 ms. Allocated memory is still 92.3 MB. Free memory was 58.4 MB in the beginning and 56.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.36 ms. Allocated memory is still 92.3 MB. Free memory was 56.6 MB in the beginning and 55.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 443.55 ms. Allocated memory is still 92.3 MB. Free memory was 55.3 MB in the beginning and 40.6 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 12243.97 ms. Allocated memory was 92.3 MB in the beginning and 195.0 MB in the end (delta: 102.8 MB). Free memory was 40.2 MB in the beginning and 80.7 MB in the end (delta: -40.5 MB). Peak memory consumption was 87.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...