./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 64bit --witnessprinter.graph.data.programhash af6d3df1a288680024c52d2d61adb02fdd276fce ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:50:23,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:50:23,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:50:23,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:50:23,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:50:23,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:50:23,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:50:23,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:50:23,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:50:23,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:50:23,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:50:23,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:50:23,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:50:23,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:50:23,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:50:23,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:50:23,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:50:23,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:50:23,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:50:23,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:50:23,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:50:23,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:50:23,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:50:23,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:50:23,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:50:23,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:50:23,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:50:23,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:50:23,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:50:23,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:50:23,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:50:23,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:50:23,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:50:23,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:50:23,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:50:23,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:50:23,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:50:23,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:50:23,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:50:23,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:50:23,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:50:23,670 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-12-07 18:50:23,680 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:50:23,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:50:23,681 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:50:23,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:50:23,681 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:50:23,682 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 18:50:23,682 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 18:50:23,682 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 18:50:23,682 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 18:50:23,682 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 18:50:23,682 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 18:50:23,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:50:23,682 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:50:23,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:50:23,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:50:23,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 18:50:23,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 18:50:23,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 18:50:23,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:50:23,683 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 18:50:23,683 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:50:23,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 18:50:23,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:50:23,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:50:23,684 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 18:50:23,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:50:23,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:50:23,684 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:50:23,684 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 18:50:23,685 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 18:50:23,685 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_be029435-7d0a-4667-bce5-fa8f0f846407/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af6d3df1a288680024c52d2d61adb02fdd276fce [2019-12-07 18:50:23,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:50:23,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:50:23,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:50:23,797 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:50:23,798 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:50:23,798 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2019-12-07 18:50:23,840 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/data/b343e87db/b3559e73f4bf4ae08a466af77580a93f/FLAG5b3e28b9f [2019-12-07 18:50:24,298 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:50:24,298 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2019-12-07 18:50:24,307 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/data/b343e87db/b3559e73f4bf4ae08a466af77580a93f/FLAG5b3e28b9f [2019-12-07 18:50:24,316 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/data/b343e87db/b3559e73f4bf4ae08a466af77580a93f [2019-12-07 18:50:24,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:50:24,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:50:24,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:50:24,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:50:24,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:50:24,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:50:24" (1/1) ... [2019-12-07 18:50:24,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c43023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24, skipping insertion in model container [2019-12-07 18:50:24,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:50:24" (1/1) ... [2019-12-07 18:50:24,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:50:24,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:50:24,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:50:24,549 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:50:24,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:50:24,606 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:50:24,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24 WrapperNode [2019-12-07 18:50:24,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:50:24,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:50:24,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:50:24,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:50:24,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24" (1/1) ... [2019-12-07 18:50:24,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24" (1/1) ... [2019-12-07 18:50:24,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:50:24,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:50:24,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:50:24,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:50:24,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24" (1/1) ... [2019-12-07 18:50:24,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24" (1/1) ... [2019-12-07 18:50:24,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24" (1/1) ... [2019-12-07 18:50:24,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24" (1/1) ... [2019-12-07 18:50:24,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24" (1/1) ... [2019-12-07 18:50:24,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24" (1/1) ... [2019-12-07 18:50:24,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24" (1/1) ... [2019-12-07 18:50:24,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:50:24,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:50:24,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:50:24,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:50:24,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:24,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:50:24,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:50:24,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:50:24,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:50:24,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:50:24,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:50:24,840 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:50:24,840 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:50:24,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:50:24 BoogieIcfgContainer [2019-12-07 18:50:24,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:50:24,841 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 18:50:24,841 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 18:50:24,844 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 18:50:24,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:50:24,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 06:50:24" (1/3) ... [2019-12-07 18:50:24,845 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5976fe9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:50:24, skipping insertion in model container [2019-12-07 18:50:24,845 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:50:24,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:24" (2/3) ... [2019-12-07 18:50:24,845 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5976fe9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:50:24, skipping insertion in model container [2019-12-07 18:50:24,845 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:50:24,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:50:24" (3/3) ... [2019-12-07 18:50:24,846 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2019-12-07 18:50:24,874 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 18:50:24,874 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 18:50:24,874 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 18:50:24,874 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:50:24,875 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:50:24,875 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 18:50:24,875 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:50:24,875 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 18:50:24,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-12-07 18:50:24,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 18:50:24,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:50:24,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:50:24,901 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 18:50:24,901 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:50:24,901 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 18:50:24,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-12-07 18:50:24,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 18:50:24,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:50:24,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:50:24,903 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 18:50:24,903 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:50:24,908 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 5#L558true assume !(main_~array_size~0 < 1); 8#L558-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;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; 6#L550-3true [2019-12-07 18:50:24,908 INFO L796 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 3#L551-3true assume !true; 4#L550-2true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 6#L550-3true [2019-12-07 18:50:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:24,912 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-12-07 18:50:24,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:24,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838292135] [2019-12-07 18:50:24,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:25,002 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:25,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:25,003 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2019-12-07 18:50:25,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:25,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923566342] [2019-12-07 18:50:25,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:25,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923566342] [2019-12-07 18:50:25,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:25,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:50:25,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605868816] [2019-12-07 18:50:25,027 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:50:25,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:25,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 18:50:25,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 18:50:25,039 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-12-07 18:50:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:25,043 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-12-07 18:50:25,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 18:50:25,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-12-07 18:50:25,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 18:50:25,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2019-12-07 18:50:25,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-12-07 18:50:25,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-12-07 18:50:25,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-12-07 18:50:25,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:50:25,049 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-12-07 18:50:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-12-07 18:50:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-12-07 18:50:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 18:50:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-12-07 18:50:25,066 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-12-07 18:50:25,066 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-12-07 18:50:25,067 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 18:50:25,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2019-12-07 18:50:25,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 18:50:25,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:50:25,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:50:25,067 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 18:50:25,067 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:50:25,068 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L558 assume !(main_~array_size~0 < 1); 40#L558-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;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; 39#L550-3 [2019-12-07 18:50:25,068 INFO L796 eck$LassoCheckResult]: Loop: 39#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 36#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 37#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 39#L550-3 [2019-12-07 18:50:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-12-07 18:50:25,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:25,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086081759] [2019-12-07 18:50:25,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:25,085 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2019-12-07 18:50:25,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:25,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905240574] [2019-12-07 18:50:25,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:25,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905240574] [2019-12-07 18:50:25,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:25,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:50:25,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052479802] [2019-12-07 18:50:25,107 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:50:25,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:25,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:50:25,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:50:25,108 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-12-07 18:50:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:25,128 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-12-07 18:50:25,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:50:25,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-12-07 18:50:25,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 18:50:25,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2019-12-07 18:50:25,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 18:50:25,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 18:50:25,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-12-07 18:50:25,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:50:25,131 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-12-07 18:50:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-12-07 18:50:25,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-12-07 18:50:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 18:50:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-12-07 18:50:25,132 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-12-07 18:50:25,132 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-12-07 18:50:25,133 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 18:50:25,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-12-07 18:50:25,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 18:50:25,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:50:25,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:50:25,134 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 18:50:25,134 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-12-07 18:50:25,134 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 59#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 60#L558 assume !(main_~array_size~0 < 1); 65#L558-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;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; 64#L550-3 [2019-12-07 18:50:25,134 INFO L796 eck$LassoCheckResult]: Loop: 64#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 61#L551-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); 62#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;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); 67#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 68#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 63#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 64#L550-3 [2019-12-07 18:50:25,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:25,135 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-12-07 18:50:25,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:25,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544806576] [2019-12-07 18:50:25,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:25,152 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:25,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2019-12-07 18:50:25,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:25,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646959856] [2019-12-07 18:50:25,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:25,175 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:25,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:25,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2019-12-07 18:50:25,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:25,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087734180] [2019-12-07 18:50:25,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:25,207 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:25,415 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:50:25,415 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:50:25,415 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:50:25,415 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:50:25,415 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:50:25,415 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:25,415 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:50:25,416 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:50:25,416 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration3_Lasso [2019-12-07 18:50:25,416 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:50:25,416 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:50:25,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:25,783 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:50:25,788 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:25,793 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 [2019-12-07 18:50:25,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:25,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:50:25,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:25,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:25,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:25,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:50:25,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:50:25,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:25,804 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 [2019-12-07 18:50:25,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:25,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:50:25,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:25,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:25,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:25,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:50:25,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:50:25,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_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:25,811 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 [2019-12-07 18:50:25,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:25,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:50:25,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:25,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:25,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:25,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:50:25,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:50:25,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:25,820 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 [2019-12-07 18:50:25,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:25,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:25,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:25,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:25,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:50:25,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:50:25,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:25,832 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 [2019-12-07 18:50:25,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:25,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:50:25,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:25,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:25,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:25,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:50:25,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:50:25,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:25,839 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 [2019-12-07 18:50:25,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:25,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:50:25,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:25,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:25,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:25,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:50:25,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:50:25,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:25,848 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 [2019-12-07 18:50:25,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:25,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:25,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:25,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:25,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:50:25,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:50:25,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:25,868 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 [2019-12-07 18:50:25,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:25,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:25,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:25,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:25,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:50:25,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:50:25,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:25,880 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 [2019-12-07 18:50:25,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:25,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:50:25,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:25,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:25,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:25,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:50:25,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:50:25,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:25,890 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 [2019-12-07 18:50:25,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:25,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:25,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:25,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:25,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:50:25,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:50:25,917 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:50:25,954 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-12-07 18:50:25,955 INFO L444 ModelExtractionUtils]: 19 out of 37 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:25,968 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:50:25,971 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 18:50:25,971 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:50:25,972 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, v_rep(select #length ULTIMATE.start_sort_~x.base)_1) = -2*ULTIMATE.start_sort_~pass~0 + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_1 Supporting invariants [-2*ULTIMATE.start_sort_~n + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_1 >= 0] [2019-12-07 18:50:25,992 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-12-07 18:50:26,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 18:50:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:26,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 18:50:26,054 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:50:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:26,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:50:26,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:50:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:50:26,089 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 [2019-12-07 18:50:26,089 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-12-07 18:50:26,136 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2019-12-07 18:50:26,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-12-07 18:50:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 18:50:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-12-07 18:50:26,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-12-07 18:50:26,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:50:26,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2019-12-07 18:50:26,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:50:26,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2019-12-07 18:50:26,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:50:26,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-12-07 18:50:26,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:50:26,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2019-12-07 18:50:26,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-12-07 18:50:26,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-12-07 18:50:26,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2019-12-07 18:50:26,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:50:26,142 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-12-07 18:50:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2019-12-07 18:50:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-12-07 18:50:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 18:50:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-12-07 18:50:26,144 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-12-07 18:50:26,144 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-12-07 18:50:26,144 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 18:50:26,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-12-07 18:50:26,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:50:26,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:50:26,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:50:26,145 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 18:50:26,145 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:50:26,145 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 165#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 166#L558 assume !(main_~array_size~0 < 1); 171#L558-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;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; 172#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 167#L551-3 [2019-12-07 18:50:26,145 INFO L796 eck$LassoCheckResult]: Loop: 167#L551-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#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;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); 174#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 167#L551-3 [2019-12-07 18:50:26,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:26,146 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-12-07 18:50:26,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:26,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466690571] [2019-12-07 18:50:26,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:26,157 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:26,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-12-07 18:50:26,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:26,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123124154] [2019-12-07 18:50:26,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:26,167 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-12-07 18:50:26,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:26,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979266646] [2019-12-07 18:50:26,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:26,185 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:26,336 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:50:26,337 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:50:26,337 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:50:26,337 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:50:26,337 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:50:26,337 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:26,337 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:50:26,337 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:50:26,337 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration4_Lasso [2019-12-07 18:50:26,337 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:50:26,337 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:50:26,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:26,664 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:50:26,664 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:26,667 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 [2019-12-07 18:50:26,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:26,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:50:26,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:26,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:26,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:26,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:50:26,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:50:26,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:26,674 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 [2019-12-07 18:50:26,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:26,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:50:26,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:26,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:26,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:26,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:50:26,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:50:26,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:26,681 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 [2019-12-07 18:50:26,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:26,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:26,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:26,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:26,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:50:26,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:50:26,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:26,691 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 [2019-12-07 18:50:26,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:26,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:26,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:26,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:26,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:50:26,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:50:26,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:26,706 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 [2019-12-07 18:50:26,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:26,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:26,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:26,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:26,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:50:26,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:50:26,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:26,720 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 [2019-12-07 18:50:26,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:26,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:26,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:26,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:26,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:50:26,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:50:26,738 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:50:26,779 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2019-12-07 18:50:26,780 INFO L444 ModelExtractionUtils]: 9 out of 37 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:26,782 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:50:26,786 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 18:50:26,786 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:50:26,786 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_sort_~i~0 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2 + 4*ULTIMATE.start_main_~array_size~0 + 1*ULTIMATE.start_sort_~x.offset >= 0] [2019-12-07 18:50:26,798 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2019-12-07 18:50:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:26,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 18:50:26,826 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:50:26,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-12-07 18:50:26,859 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:50:26,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:50:26,867 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:50:26,867 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-12-07 18:50:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:26,885 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:50:26,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:50:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:26,899 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 [2019-12-07 18:50:26,899 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-12-07 18:50:26,933 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 30 states and 44 transitions. Complement of second has 8 states. [2019-12-07 18:50:26,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 18:50:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 18:50:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-12-07 18:50:26,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-12-07 18:50:26,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:50:26,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-12-07 18:50:26,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:50:26,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-12-07 18:50:26,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:50:26,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2019-12-07 18:50:26,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:50:26,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2019-12-07 18:50:26,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-12-07 18:50:26,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-12-07 18:50:26,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-12-07 18:50:26,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:50:26,937 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-12-07 18:50:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-12-07 18:50:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-12-07 18:50:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 18:50:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-12-07 18:50:26,939 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 18:50:26,939 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 18:50:26,939 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 18:50:26,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-12-07 18:50:26,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:50:26,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:50:26,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:50:26,940 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:26,940 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:50:26,940 INFO L794 eck$LassoCheckResult]: Stem: 292#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 289#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 290#L558 assume !(main_~array_size~0 < 1); 291#L558-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;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; 293#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 285#L551-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); 286#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 295#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 296#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 287#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 288#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 283#L551-3 [2019-12-07 18:50:26,940 INFO L796 eck$LassoCheckResult]: Loop: 283#L551-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); 284#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;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); 294#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 283#L551-3 [2019-12-07 18:50:26,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:26,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2019-12-07 18:50:26,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:26,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483107701] [2019-12-07 18:50:26,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:26,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483107701] [2019-12-07 18:50:26,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682282569] [2019-12-07 18:50:26,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:50:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:26,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:50:26,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:50:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:27,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:50:27,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-07 18:50:27,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113481142] [2019-12-07 18:50:27,006 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:50:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-12-07 18:50:27,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:27,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286043027] [2019-12-07 18:50:27,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:27,014 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:27,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:27,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:50:27,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:50:27,069 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-12-07 18:50:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:27,104 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-12-07 18:50:27,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:50:27,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-12-07 18:50:27,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:50:27,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2019-12-07 18:50:27,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-12-07 18:50:27,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-12-07 18:50:27,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-12-07 18:50:27,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:50:27,107 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-12-07 18:50:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-12-07 18:50:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-12-07 18:50:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 18:50:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-12-07 18:50:27,110 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-12-07 18:50:27,110 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-12-07 18:50:27,110 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 18:50:27,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-12-07 18:50:27,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:50:27,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:50:27,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:50:27,111 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:27,111 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:50:27,111 INFO L794 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 368#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 369#L558 assume !(main_~array_size~0 < 1); 376#L558-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;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; 378#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 379#L551-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); 381#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 382#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 372#L551-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); 373#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 384#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 383#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 374#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 375#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 370#L551-3 [2019-12-07 18:50:27,111 INFO L796 eck$LassoCheckResult]: Loop: 370#L551-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); 371#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;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); 380#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 370#L551-3 [2019-12-07 18:50:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:27,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2019-12-07 18:50:27,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:27,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344052793] [2019-12-07 18:50:27,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:27,137 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:27,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:27,137 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-12-07 18:50:27,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:27,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641392044] [2019-12-07 18:50:27,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:27,159 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:27,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:27,160 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2019-12-07 18:50:27,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:27,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754158328] [2019-12-07 18:50:27,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:27,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754158328] [2019-12-07 18:50:27,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124563736] [2019-12-07 18:50:27,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:50:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:27,353 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:50:27,354 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:50:27,389 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 18:50:27,389 INFO L377 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 [2019-12-07 18:50:27,390 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:50:27,391 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:50:27,391 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:50:27,391 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-12-07 18:50:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:50:27,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:50:27,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-12-07 18:50:27,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753326070] [2019-12-07 18:50:27,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:27,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:50:27,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:50:27,457 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 15 states. [2019-12-07 18:50:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:27,531 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-12-07 18:50:27,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:50:27,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2019-12-07 18:50:27,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 18:50:27,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2019-12-07 18:50:27,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-12-07 18:50:27,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-12-07 18:50:27,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-12-07 18:50:27,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:50:27,534 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-12-07 18:50:27,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-12-07 18:50:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-12-07 18:50:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 18:50:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-12-07 18:50:27,537 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-12-07 18:50:27,537 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-12-07 18:50:27,537 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 18:50:27,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-12-07 18:50:27,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:50:27,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:50:27,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:50:27,538 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:27,538 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:50:27,538 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 492#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 493#L558 assume !(main_~array_size~0 < 1); 500#L558-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;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; 502#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 503#L551-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); 512#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 510#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 496#L551-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); 497#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;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); 508#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 516#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 515#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 514#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 494#L551-3 [2019-12-07 18:50:27,538 INFO L796 eck$LassoCheckResult]: Loop: 494#L551-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); 495#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;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); 507#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 494#L551-3 [2019-12-07 18:50:27,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:27,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2019-12-07 18:50:27,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:27,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286843860] [2019-12-07 18:50:27,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:27,560 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:27,560 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-12-07 18:50:27,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:27,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396871737] [2019-12-07 18:50:27,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:27,568 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:27,569 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2019-12-07 18:50:27,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:27,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524445310] [2019-12-07 18:50:27,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:27,593 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:27,850 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2019-12-07 18:50:27,905 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:50:27,905 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:50:27,905 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:50:27,905 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:50:27,906 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:50:27,906 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:27,906 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:50:27,906 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:50:27,906 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration7_Lasso [2019-12-07 18:50:27,906 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:50:27,906 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:50:27,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:27,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:27,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:28,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:28,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:28,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:28,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:28,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:28,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:28,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:28,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:28,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:28,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:28,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:50:28,281 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:50:28,282 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:28,284 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 [2019-12-07 18:50:28,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:28,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:50:28,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:28,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:28,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:28,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:50:28,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:50:28,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:28,292 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 [2019-12-07 18:50:28,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:28,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:28,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:28,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:28,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:50:28,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:50:28,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:50:28,302 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 [2019-12-07 18:50:28,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:28,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:28,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:28,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:28,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:50:28,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:50:28,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:28,316 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 [2019-12-07 18:50:28,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:50:28,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:50:28,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:50:28,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:50:28,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:50:28,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:50:28,338 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:50:28,386 INFO L443 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2019-12-07 18:50:28,386 INFO L444 ModelExtractionUtils]: 5 out of 37 variables were initially zero. Simplification set additionally 28 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be029435-7d0a-4667-bce5-fa8f0f846407/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 [2019-12-07 18:50:28,388 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:50:28,392 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 18:50:28,392 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:50:28,392 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x.base)_3, ULTIMATE.start_sort_~i~0) = 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_3 - 4*ULTIMATE.start_sort_~i~0 Supporting invariants [1*ULTIMATE.start_sort_~x.offset >= 0] [2019-12-07 18:50:28,410 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-12-07 18:50:28,412 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 18:50:28,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:28,440 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:50:28,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:50:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:28,459 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:50:28,460 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:50:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:28,470 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 [2019-12-07 18:50:28,470 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-12-07 18:50:28,493 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 50 states and 70 transitions. Complement of second has 8 states. [2019-12-07 18:50:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 18:50:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 18:50:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-12-07 18:50:28,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-12-07 18:50:28,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:50:28,494 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 18:50:28,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:28,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:50:28,518 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:50:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:28,527 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:50:28,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:50:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:28,537 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-12-07 18:50:28,537 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-12-07 18:50:28,557 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 50 states and 70 transitions. Complement of second has 8 states. [2019-12-07 18:50:28,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 18:50:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 18:50:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-12-07 18:50:28,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-12-07 18:50:28,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:50:28,558 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 18:50:28,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:28,582 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:50:28,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:50:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:28,593 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:50:28,593 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:50:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:28,603 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-12-07 18:50:28,603 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-12-07 18:50:28,627 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 58 transitions. Complement of second has 7 states. [2019-12-07 18:50:28,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 18:50:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 18:50:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-12-07 18:50:28,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-12-07 18:50:28,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:50:28,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2019-12-07 18:50:28,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:50:28,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2019-12-07 18:50:28,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:50:28,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2019-12-07 18:50:28,629 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 18:50:28,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-12-07 18:50:28,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 18:50:28,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 18:50:28,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 18:50:28,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:50:28,629 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:50:28,629 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:50:28,630 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:50:28,630 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 18:50:28,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:50:28,630 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 18:50:28,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 18:50:28,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 06:50:28 BoogieIcfgContainer [2019-12-07 18:50:28,634 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 18:50:28,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:50:28,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:50:28,634 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:50:28,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:50:24" (3/4) ... [2019-12-07 18:50:28,637 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:50:28,637 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:50:28,638 INFO L168 Benchmark]: Toolchain (without parser) took 4319.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:50:28,638 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:50:28,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:28,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:50:28,639 INFO L168 Benchmark]: Boogie Preprocessor took 17.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:28,639 INFO L168 Benchmark]: RCFGBuilder took 187.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:28,639 INFO L168 Benchmark]: BuchiAutomizer took 3792.57 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.9 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:28,639 INFO L168 Benchmark]: Witness Printer took 2.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:50:28,641 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 287.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 187.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3792.57 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.9 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * pass + unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function -1 * i + array_size and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 89 SDtfs, 92 SDslu, 91 SDs, 0 SdLazy, 152 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital193 mio100 ax109 hnf99 lsp88 ukn62 mio100 lsp64 div100 bol100 ite100 ukn100 eq178 hnf86 smp99 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...