./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fc86a08ff37d05adddb13279399a852f6ece83c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:43,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:43,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:43,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:43,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:43,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:43,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:43,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:43,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:43,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:43,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:43,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:43,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:43,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:43,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:43,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:43,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:43,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:43,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:43,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:43,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:43,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:43,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:43,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:43,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:43,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:43,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:43,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:43,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:43,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:43,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:43,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:43,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:43,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:43,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:43,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:43,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:43,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:43,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:43,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:43,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:43,737 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:55:43,748 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:43,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:43,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:43,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:43,750 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:43,750 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:43,750 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:43,750 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:43,751 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:43,751 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:43,751 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:43,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:43,751 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:43,751 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:43,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:43,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:43,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:43,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:43,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:43,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:43,753 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:43,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:43,753 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:43,753 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:43,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:43,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:43,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:43,754 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:43,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:43,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:43,755 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:43,756 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:43,756 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/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fc86a08ff37d05adddb13279399a852f6ece83c [2019-10-22 08:55:43,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:43,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:43,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:43,791 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:43,792 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:43,792 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort.i [2019-10-22 08:55:43,833 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer/data/fa1407e48/ca099f28742f4e218755633a7a3b15e2/FLAG99161ed02 [2019-10-22 08:55:44,191 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:44,192 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/sv-benchmarks/c/loop-invgen/heapsort.i [2019-10-22 08:55:44,196 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer/data/fa1407e48/ca099f28742f4e218755633a7a3b15e2/FLAG99161ed02 [2019-10-22 08:55:44,606 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer/data/fa1407e48/ca099f28742f4e218755633a7a3b15e2 [2019-10-22 08:55:44,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:44,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:44,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:44,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:44,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:44,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6acd85ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44, skipping insertion in model container [2019-10-22 08:55:44,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,628 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:44,647 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:44,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:44,787 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:44,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:44,886 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:44,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44 WrapperNode [2019-10-22 08:55:44,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:44,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:44,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:44,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:44,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:44,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:44,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:44,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:44,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:44,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:44,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:44,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:44,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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-10-22 08:55:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:45,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:45,239 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:45,239 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-10-22 08:55:45,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:45 BoogieIcfgContainer [2019-10-22 08:55:45,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:45,241 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:45,241 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:45,244 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:45,245 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:45,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:44" (1/3) ... [2019-10-22 08:55:45,246 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51c886f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:45, skipping insertion in model container [2019-10-22 08:55:45,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:45,246 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44" (2/3) ... [2019-10-22 08:55:45,246 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51c886f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:45, skipping insertion in model container [2019-10-22 08:55:45,247 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:45,247 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:45" (3/3) ... [2019-10-22 08:55:45,248 INFO L371 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2019-10-22 08:55:45,288 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:45,288 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:45,288 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:45,288 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:45,288 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:45,289 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:45,289 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:45,289 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:45,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-10-22 08:55:45,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-10-22 08:55:45,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:45,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:45,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:55:45,332 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:45,333 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:45,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-10-22 08:55:45,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-10-22 08:55:45,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:45,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:45,337 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:55:45,337 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:45,344 INFO L791 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 55#L13true assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 31#L16true assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 40#L45-1true [2019-10-22 08:55:45,344 INFO L793 eck$LassoCheckResult]: Loop: 40#L45-1true assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 53#L24-2true assume !true; 52#L24-3true assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 32#L4-30true assume !(0 == __VERIFIER_assert_~cond); 44#L4-32true __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 42#L4-33true assume !(0 == __VERIFIER_assert_~cond); 39#L4-35true main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 40#L45-1true [2019-10-22 08:55:45,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,350 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2019-10-22 08:55:45,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132966760] [2019-10-22 08:55:45,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,459 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115875, now seen corresponding path program 1 times [2019-10-22 08:55:45,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931804009] [2019-10-22 08:55:45,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:45,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931804009] [2019-10-22 08:55:45,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:45,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:45,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945845480] [2019-10-22 08:55:45,491 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:45,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:45,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:55:45,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:55:45,506 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2019-10-22 08:55:45,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:45,513 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-10-22 08:55:45,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:55:45,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2019-10-22 08:55:45,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-10-22 08:55:45,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 42 transitions. [2019-10-22 08:55:45,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-10-22 08:55:45,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-10-22 08:55:45,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2019-10-22 08:55:45,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:45,524 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-10-22 08:55:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2019-10-22 08:55:45,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 08:55:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 08:55:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-10-22 08:55:45,548 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-10-22 08:55:45,548 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-10-22 08:55:45,548 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:45,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-10-22 08:55:45,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-10-22 08:55:45,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:45,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:45,550 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:55:45,550 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:45,550 INFO L791 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 116#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 117#L45-1 [2019-10-22 08:55:45,550 INFO L793 eck$LassoCheckResult]: Loop: 117#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 124#L24-2 assume !(main_~j~0 <= main_~r~0); 144#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 129#L4-36 assume !(0 == __VERIFIER_assert_~cond); 130#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 143#L4-39 assume !(0 == __VERIFIER_assert_~cond); 141#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 117#L45-1 [2019-10-22 08:55:45,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,551 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 2 times [2019-10-22 08:55:45,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708298989] [2019-10-22 08:55:45,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,566 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:45,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1043651989, now seen corresponding path program 1 times [2019-10-22 08:55:45,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716207448] [2019-10-22 08:55:45,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:45,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716207448] [2019-10-22 08:55:45,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:45,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:45,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867442291] [2019-10-22 08:55:45,626 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:45,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:45,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:45,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:45,627 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 08:55:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:45,745 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-10-22 08:55:45,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:45,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2019-10-22 08:55:45,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-10-22 08:55:45,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 80 transitions. [2019-10-22 08:55:45,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-10-22 08:55:45,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-10-22 08:55:45,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 80 transitions. [2019-10-22 08:55:45,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:45,750 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-10-22 08:55:45,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 80 transitions. [2019-10-22 08:55:45,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2019-10-22 08:55:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 08:55:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-10-22 08:55:45,753 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-10-22 08:55:45,754 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-10-22 08:55:45,754 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:45,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2019-10-22 08:55:45,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-10-22 08:55:45,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:45,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:45,755 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:55:45,755 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:45,755 INFO L791 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 264#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 230#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 231#L45-1 [2019-10-22 08:55:45,755 INFO L793 eck$LassoCheckResult]: Loop: 231#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 247#L24-2 assume !(main_~j~0 <= main_~r~0); 262#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 234#L4-30 assume !(0 == __VERIFIER_assert_~cond); 235#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 250#L4-33 assume !(0 == __VERIFIER_assert_~cond); 246#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 231#L45-1 [2019-10-22 08:55:45,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,756 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 3 times [2019-10-22 08:55:45,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916852780] [2019-10-22 08:55:45,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,772 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 1 times [2019-10-22 08:55:45,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203184720] [2019-10-22 08:55:45,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,798 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:45,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,798 INFO L82 PathProgramCache]: Analyzing trace with hash -769702287, now seen corresponding path program 1 times [2019-10-22 08:55:45,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747756168] [2019-10-22 08:55:45,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:45,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747756168] [2019-10-22 08:55:45,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:45,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:45,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770277779] [2019-10-22 08:55:45,999 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:46,000 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:46,000 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:46,000 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:46,000 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:46,001 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:46,001 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:46,001 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:46,001 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2019-10-22 08:55:46,001 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:46,001 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:46,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,104 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:46,105 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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) [2019-10-22 08:55:46,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:46,116 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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) [2019-10-22 08:55:46,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:46,129 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:46,334 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:46,337 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:46,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:46,337 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:46,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:46,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:46,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:46,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:46,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:46,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2019-10-22 08:55:46,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:46,338 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:46,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,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-10-22 08:55:46,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,439 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:46,443 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:46,445 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-10-22 08:55:46,447 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:46,447 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:46,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:46,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:46,448 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:46,450 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:46,451 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:46,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:46,460 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-10-22 08:55:46,461 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:46,461 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:46,461 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:46,461 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:46,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:46,462 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:46,462 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:46,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:46,466 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-10-22 08:55:46,469 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:46,469 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:46,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:46,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:46,469 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:46,471 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:46,473 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:46,485 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:46,500 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:46,503 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:46,504 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:46,505 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:46,505 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:46,506 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2019-10-22 08:55:46,507 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:46,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:46,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:46,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:46,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:46,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:46,576 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:46,576 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:55:46,646 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 111 states and 132 transitions. Complement of second has 6 states. [2019-10-22 08:55:46,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:55:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2019-10-22 08:55:46,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 7 letters. [2019-10-22 08:55:46,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:46,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 10 letters. Loop has 7 letters. [2019-10-22 08:55:46,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:46,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 14 letters. [2019-10-22 08:55:46,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:46,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2019-10-22 08:55:46,657 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2019-10-22 08:55:46,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 106 states and 125 transitions. [2019-10-22 08:55:46,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-10-22 08:55:46,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2019-10-22 08:55:46,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 125 transitions. [2019-10-22 08:55:46,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:46,663 INFO L688 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2019-10-22 08:55:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 125 transitions. [2019-10-22 08:55:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-22 08:55:46,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-22 08:55:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-10-22 08:55:46,675 INFO L711 BuchiCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-10-22 08:55:46,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:46,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:46,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:46,676 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 3 states. [2019-10-22 08:55:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:46,702 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2019-10-22 08:55:46,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:46,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 147 transitions. [2019-10-22 08:55:46,707 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2019-10-22 08:55:46,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 110 transitions. [2019-10-22 08:55:46,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-10-22 08:55:46,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-10-22 08:55:46,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 110 transitions. [2019-10-22 08:55:46,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:46,709 INFO L688 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-10-22 08:55:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 110 transitions. [2019-10-22 08:55:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2019-10-22 08:55:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 08:55:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-10-22 08:55:46,718 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-10-22 08:55:46,718 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-10-22 08:55:46,718 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:55:46,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-10-22 08:55:46,719 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2019-10-22 08:55:46,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:46,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:46,719 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:55:46,719 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:46,720 INFO L791 eck$LassoCheckResult]: Stem: 698#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 699#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 665#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 666#L45-1 [2019-10-22 08:55:46,720 INFO L793 eck$LassoCheckResult]: Loop: 666#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 705#L24-2 assume !(main_~j~0 <= main_~r~0); 703#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 670#L4-30 assume !(0 == __VERIFIER_assert_~cond); 671#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 686#L4-33 assume !(0 == __VERIFIER_assert_~cond); 682#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 666#L45-1 [2019-10-22 08:55:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,720 INFO L82 PathProgramCache]: Analyzing trace with hash 30947, now seen corresponding path program 1 times [2019-10-22 08:55:46,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:46,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566420844] [2019-10-22 08:55:46,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,739 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 2 times [2019-10-22 08:55:46,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:46,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501610678] [2019-10-22 08:55:46,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,759 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash 39644339, now seen corresponding path program 1 times [2019-10-22 08:55:46,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:46,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143817349] [2019-10-22 08:55:46,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:46,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143817349] [2019-10-22 08:55:46,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:46,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:46,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897060568] [2019-10-22 08:55:46,925 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:46,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:46,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:46,925 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:46,925 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:46,925 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:46,926 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:46,926 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:46,926 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2019-10-22 08:55:46,926 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:46,926 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:46,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,996 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:46,996 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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-10-22 08:55:47,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:47,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:47,009 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:47,010 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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-10-22 08:55:47,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:47,030 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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) [2019-10-22 08:55:47,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:47,042 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:47,333 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:47,335 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:47,336 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:47,336 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:47,336 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:47,336 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:47,336 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:47,336 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:47,336 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:47,336 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2019-10-22 08:55:47,336 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:47,336 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:47,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,416 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:47,417 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:47,417 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-10-22 08:55:47,418 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:47,418 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:47,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:47,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:47,418 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:47,419 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:47,419 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:47,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:47,422 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-10-22 08:55:47,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:47,423 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:47,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:47,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:47,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:47,424 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:47,424 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:47,430 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:47,433 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:47,434 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:47,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:47,434 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:47,434 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:47,434 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2019-10-22 08:55:47,435 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:47,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:47,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:47,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:47,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-10-22 08:55:47,471 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:47,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-10-22 08:55:47,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 155 states and 181 transitions. Complement of second has 6 states. [2019-10-22 08:55:47,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:55:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2019-10-22 08:55:47,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 7 letters. [2019-10-22 08:55:47,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:47,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 10 letters. Loop has 7 letters. [2019-10-22 08:55:47,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:47,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 14 letters. [2019-10-22 08:55:47,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:47,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 181 transitions. [2019-10-22 08:55:47,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2019-10-22 08:55:47,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 120 states and 140 transitions. [2019-10-22 08:55:47,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-10-22 08:55:47,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-10-22 08:55:47,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 140 transitions. [2019-10-22 08:55:47,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:47,502 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-10-22 08:55:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 140 transitions. [2019-10-22 08:55:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 63. [2019-10-22 08:55:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 08:55:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-10-22 08:55:47,505 INFO L711 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-10-22 08:55:47,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:47,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:47,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:47,506 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2019-10-22 08:55:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:47,661 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2019-10-22 08:55:47,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:55:47,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 220 transitions. [2019-10-22 08:55:47,664 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-10-22 08:55:47,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 220 transitions. [2019-10-22 08:55:47,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-10-22 08:55:47,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2019-10-22 08:55:47,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2019-10-22 08:55:47,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:47,666 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2019-10-22 08:55:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2019-10-22 08:55:47,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 64. [2019-10-22 08:55:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 08:55:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-10-22 08:55:47,670 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-10-22 08:55:47,670 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-10-22 08:55:47,670 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:55:47,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-10-22 08:55:47,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-10-22 08:55:47,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:47,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:47,671 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:55:47,671 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:47,671 INFO L791 eck$LassoCheckResult]: Stem: 1259#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1260#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1203#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 1205#L45-1 [2019-10-22 08:55:47,672 INFO L793 eck$LassoCheckResult]: Loop: 1205#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1232#L24-2 assume !!(main_~j~0 <= main_~r~0); 1239#L25 assume !(main_~j~0 < main_~r~0); 1236#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1234#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1228#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1222#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1223#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1253#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1226#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1227#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1252#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1249#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1205#L45-1 [2019-10-22 08:55:47,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,672 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 4 times [2019-10-22 08:55:47,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323332501] [2019-10-22 08:55:47,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,682 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:47,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2136697343, now seen corresponding path program 1 times [2019-10-22 08:55:47,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626430515] [2019-10-22 08:55:47,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,703 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:47,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737125, now seen corresponding path program 1 times [2019-10-22 08:55:47,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528269060] [2019-10-22 08:55:47,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:47,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528269060] [2019-10-22 08:55:47,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:47,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:47,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225871071] [2019-10-22 08:55:47,903 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:47,904 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:47,904 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:47,904 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:47,904 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:47,904 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:47,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:47,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:47,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2019-10-22 08:55:47,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:47,904 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:47,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,988 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:47,988 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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) [2019-10-22 08:55:47,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:47,993 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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) [2019-10-22 08:55:48,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:48,005 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:48,018 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:48,020 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:48,021 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:48,021 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:48,021 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:48,021 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:48,021 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:48,021 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:48,021 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:48,021 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2019-10-22 08:55:48,021 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:48,021 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:48,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,110 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:48,111 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:48,111 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-10-22 08:55:48,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:48,112 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:48,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:48,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:48,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:48,113 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:48,113 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:48,123 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:48,126 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:48,126 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:48,127 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:48,127 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:48,127 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:48,127 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-10-22 08:55:48,127 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:48,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:48,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:48,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:48,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:48,172 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:48,172 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-10-22 08:55:48,203 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 124 states and 144 transitions. Complement of second has 4 states. [2019-10-22 08:55:48,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2019-10-22 08:55:48,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 13 letters. [2019-10-22 08:55:48,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:48,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2019-10-22 08:55:48,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:48,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 26 letters. [2019-10-22 08:55:48,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:48,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2019-10-22 08:55:48,206 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-10-22 08:55:48,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 138 transitions. [2019-10-22 08:55:48,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-10-22 08:55:48,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-10-22 08:55:48,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 138 transitions. [2019-10-22 08:55:48,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:48,207 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2019-10-22 08:55:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 138 transitions. [2019-10-22 08:55:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-10-22 08:55:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-22 08:55:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2019-10-22 08:55:48,215 INFO L711 BuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2019-10-22 08:55:48,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:48,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:48,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:48,216 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 4 states. [2019-10-22 08:55:48,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:48,250 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-10-22 08:55:48,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:48,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 75 transitions. [2019-10-22 08:55:48,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-10-22 08:55:48,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 74 transitions. [2019-10-22 08:55:48,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-10-22 08:55:48,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-10-22 08:55:48,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2019-10-22 08:55:48,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:48,252 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-10-22 08:55:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2019-10-22 08:55:48,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-22 08:55:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 08:55:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-10-22 08:55:48,255 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-10-22 08:55:48,255 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-10-22 08:55:48,255 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:55:48,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 74 transitions. [2019-10-22 08:55:48,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-10-22 08:55:48,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:48,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:48,256 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:55:48,256 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:48,256 INFO L791 eck$LassoCheckResult]: Stem: 1702#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1703#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1646#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 1647#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1675#L24-2 [2019-10-22 08:55:48,256 INFO L793 eck$LassoCheckResult]: Loop: 1675#L24-2 assume !!(main_~j~0 <= main_~r~0); 1682#L25 assume !(main_~j~0 < main_~r~0); 1677#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1678#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1670#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1664#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1665#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1696#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1668#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1669#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1695#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1692#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1674#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1675#L24-2 [2019-10-22 08:55:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:48,257 INFO L82 PathProgramCache]: Analyzing trace with hash 959377, now seen corresponding path program 1 times [2019-10-22 08:55:48,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:48,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915353511] [2019-10-22 08:55:48,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:48,274 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:48,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:48,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1321235687, now seen corresponding path program 2 times [2019-10-22 08:55:48,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:48,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621700606] [2019-10-22 08:55:48,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:48,302 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:48,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:48,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1718346921, now seen corresponding path program 1 times [2019-10-22 08:55:48,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:48,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89904334] [2019-10-22 08:55:48,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:48,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89904334] [2019-10-22 08:55:48,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:48,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:48,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370551526] [2019-10-22 08:55:48,539 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:48,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:48,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:48,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:48,540 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:48,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:48,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:48,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:48,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2019-10-22 08:55:48,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:48,540 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:48,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-10-22 08:55:48,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-10-22 08:55:48,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,629 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:48,629 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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-10-22 08:55:48,633 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:48,633 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:48,636 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:48,636 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=7} Honda state: {ULTIMATE.start_main_#t~nondet5=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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-10-22 08:55:48,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:48,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:48,643 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:48,643 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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-10-22 08:55:48,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:48,647 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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) [2019-10-22 08:55:48,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:48,663 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:48,914 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:48,916 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:48,916 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:48,916 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:48,916 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:48,916 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:48,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:48,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:48,916 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:48,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2019-10-22 08:55:48,916 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:48,916 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:48,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,998 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:48,999 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:48,999 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-10-22 08:55:49,000 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:49,000 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:49,000 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:49,000 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:49,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:49,001 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:49,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:49,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:49,003 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-10-22 08:55:49,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:49,004 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:49,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:49,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:49,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:49,005 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:49,005 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:49,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:49,007 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-10-22 08:55:49,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:49,007 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:49,007 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:49,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:49,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:49,008 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:49,008 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:49,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:49,009 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-10-22 08:55:49,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:49,010 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:49,010 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:49,010 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:49,010 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:49,011 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:49,011 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:49,015 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:49,018 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:49,018 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:49,018 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:49,019 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:49,019 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:49,019 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-10-22 08:55:49,019 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:49,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:49,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:49,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:49,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:49,070 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:49,070 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-10-22 08:55:49,122 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 128 states and 150 transitions. Complement of second has 6 states. [2019-10-22 08:55:49,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:55:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2019-10-22 08:55:49,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 13 letters. [2019-10-22 08:55:49,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:49,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 17 letters. Loop has 13 letters. [2019-10-22 08:55:49,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:49,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 26 letters. [2019-10-22 08:55:49,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:49,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 150 transitions. [2019-10-22 08:55:49,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-10-22 08:55:49,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 122 states and 143 transitions. [2019-10-22 08:55:49,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-10-22 08:55:49,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-10-22 08:55:49,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 143 transitions. [2019-10-22 08:55:49,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:49,128 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 143 transitions. [2019-10-22 08:55:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 143 transitions. [2019-10-22 08:55:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-10-22 08:55:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-22 08:55:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2019-10-22 08:55:49,132 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-10-22 08:55:49,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:49,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:49,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:49,133 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 6 states. [2019-10-22 08:55:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:49,304 INFO L93 Difference]: Finished difference Result 401 states and 447 transitions. [2019-10-22 08:55:49,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:49,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 447 transitions. [2019-10-22 08:55:49,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-10-22 08:55:49,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 353 states and 395 transitions. [2019-10-22 08:55:49,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-10-22 08:55:49,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-10-22 08:55:49,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 395 transitions. [2019-10-22 08:55:49,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:49,309 INFO L688 BuchiCegarLoop]: Abstraction has 353 states and 395 transitions. [2019-10-22 08:55:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 395 transitions. [2019-10-22 08:55:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 121. [2019-10-22 08:55:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-22 08:55:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-10-22 08:55:49,315 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-10-22 08:55:49,315 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-10-22 08:55:49,316 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:55:49,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 141 transitions. [2019-10-22 08:55:49,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-10-22 08:55:49,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:49,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:49,317 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:49,317 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:49,317 INFO L791 eck$LassoCheckResult]: Stem: 2504#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 2505#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2447#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2448#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2475#L24-2 assume !!(main_~j~0 <= main_~r~0); 2483#L25 [2019-10-22 08:55:49,317 INFO L793 eck$LassoCheckResult]: Loop: 2483#L25 assume !(main_~j~0 < main_~r~0); 2478#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2479#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2471#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2465#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2466#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2495#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2491#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2487#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2488#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2508#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2502#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2463#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2457#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2458#L24-2 assume !!(main_~j~0 <= main_~r~0); 2483#L25 [2019-10-22 08:55:49,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:49,317 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 1 times [2019-10-22 08:55:49,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:49,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281632057] [2019-10-22 08:55:49,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:49,331 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:49,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:49,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1728992636, now seen corresponding path program 1 times [2019-10-22 08:55:49,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:49,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721041227] [2019-10-22 08:55:49,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:49,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721041227] [2019-10-22 08:55:49,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:49,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:49,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895326130] [2019-10-22 08:55:49,433 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:49,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:49,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:49,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:49,435 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. cyclomatic complexity: 24 Second operand 6 states. [2019-10-22 08:55:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:49,582 INFO L93 Difference]: Finished difference Result 226 states and 254 transitions. [2019-10-22 08:55:49,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:49,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 254 transitions. [2019-10-22 08:55:49,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-10-22 08:55:49,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 212 states and 240 transitions. [2019-10-22 08:55:49,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-10-22 08:55:49,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-10-22 08:55:49,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 240 transitions. [2019-10-22 08:55:49,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:49,585 INFO L688 BuchiCegarLoop]: Abstraction has 212 states and 240 transitions. [2019-10-22 08:55:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 240 transitions. [2019-10-22 08:55:49,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 163. [2019-10-22 08:55:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 08:55:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2019-10-22 08:55:49,596 INFO L711 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-10-22 08:55:49,596 INFO L591 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-10-22 08:55:49,596 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:55:49,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 185 transitions. [2019-10-22 08:55:49,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-10-22 08:55:49,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:49,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:49,597 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:49,597 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:49,598 INFO L791 eck$LassoCheckResult]: Stem: 2870#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 2871#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2811#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2812#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2839#L24-2 assume !!(main_~j~0 <= main_~r~0); 2848#L25 [2019-10-22 08:55:49,598 INFO L793 eck$LassoCheckResult]: Loop: 2848#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2849#L4 assume !(0 == __VERIFIER_assert_~cond); 2879#L4-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2875#L4-3 assume !(0 == __VERIFIER_assert_~cond); 2866#L4-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2825#L4-6 assume !(0 == __VERIFIER_assert_~cond); 2819#L4-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2813#L4-9 assume !(0 == __VERIFIER_assert_~cond); 2814#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 2842#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2843#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2835#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2829#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2830#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2861#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2857#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2853#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2854#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2877#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2868#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2827#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2821#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2822#L24-2 assume !!(main_~j~0 <= main_~r~0); 2848#L25 [2019-10-22 08:55:49,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:49,598 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 2 times [2019-10-22 08:55:49,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:49,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26205043] [2019-10-22 08:55:49,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:49,605 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:49,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:49,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2022918237, now seen corresponding path program 1 times [2019-10-22 08:55:49,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:49,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441140079] [2019-10-22 08:55:49,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:49,633 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:49,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash -301361000, now seen corresponding path program 1 times [2019-10-22 08:55:49,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:49,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040052054] [2019-10-22 08:55:49,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:49,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040052054] [2019-10-22 08:55:49,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710030451] [2019-10-22 08:55:49,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:49,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:55:49,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:49,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:49,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:49,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:55:49,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-10-22 08:55:49,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944021741] [2019-10-22 08:55:50,075 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-10-22 08:55:50,076 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-10-22 08:55:50,732 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2019-10-22 08:55:50,733 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:50,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:50,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:50,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:50,733 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:50,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:50,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:50,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:50,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2019-10-22 08:55:50,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:50,734 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:50,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:50,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:50,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:50,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:50,818 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:50,819 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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) [2019-10-22 08:55:50,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:50,825 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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) [2019-10-22 08:55:50,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:50,846 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:50,985 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:50,987 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:50,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:50,987 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:50,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:50,988 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:50,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:50,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:50,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:50,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2019-10-22 08:55:50,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:50,988 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:50,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:51,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:51,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:51,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:51,082 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:51,082 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:51,082 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-10-22 08:55:51,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:51,083 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:51,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:51,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:51,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:51,084 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:51,084 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:51,088 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:51,096 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:51,101 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:51,102 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:51,102 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:51,102 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:51,102 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~n~0) = -4*ULTIMATE.start_main_~j~0 + 5*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-10-22 08:55:51,103 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:51,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:51,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:51,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:55:51,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:51,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:51,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:51,270 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-10-22 08:55:51,270 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-10-22 08:55:51,514 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 9 states. Result 638 states and 696 transitions. Complement of second has 17 states. [2019-10-22 08:55:51,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:55:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2019-10-22 08:55:51,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 78 transitions. Stem has 5 letters. Loop has 23 letters. [2019-10-22 08:55:51,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:51,516 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:51,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:51,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:51,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:55:51,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:51,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:51,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:51,686 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-10-22 08:55:51,686 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-10-22 08:55:52,189 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 9 states. Result 724 states and 790 transitions. Complement of second has 27 states. [2019-10-22 08:55:52,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:55:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2019-10-22 08:55:52,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 5 letters. Loop has 23 letters. [2019-10-22 08:55:52,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:52,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 28 letters. Loop has 23 letters. [2019-10-22 08:55:52,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:52,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 5 letters. Loop has 46 letters. [2019-10-22 08:55:52,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:52,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 724 states and 790 transitions. [2019-10-22 08:55:52,200 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-10-22 08:55:52,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 724 states to 581 states and 644 transitions. [2019-10-22 08:55:52,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-10-22 08:55:52,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-10-22 08:55:52,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 581 states and 644 transitions. [2019-10-22 08:55:52,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:52,204 INFO L688 BuchiCegarLoop]: Abstraction has 581 states and 644 transitions. [2019-10-22 08:55:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states and 644 transitions. [2019-10-22 08:55:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 409. [2019-10-22 08:55:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-22 08:55:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 456 transitions. [2019-10-22 08:55:52,214 INFO L711 BuchiCegarLoop]: Abstraction has 409 states and 456 transitions. [2019-10-22 08:55:52,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:55:52,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:55:52,215 INFO L87 Difference]: Start difference. First operand 409 states and 456 transitions. Second operand 7 states. [2019-10-22 08:55:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:52,691 INFO L93 Difference]: Finished difference Result 608 states and 655 transitions. [2019-10-22 08:55:52,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:55:52,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 655 transitions. [2019-10-22 08:55:52,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-10-22 08:55:52,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 302 states and 340 transitions. [2019-10-22 08:55:52,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-10-22 08:55:52,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-10-22 08:55:52,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 340 transitions. [2019-10-22 08:55:52,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:52,700 INFO L688 BuchiCegarLoop]: Abstraction has 302 states and 340 transitions. [2019-10-22 08:55:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 340 transitions. [2019-10-22 08:55:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 210. [2019-10-22 08:55:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-22 08:55:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 238 transitions. [2019-10-22 08:55:52,705 INFO L711 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-10-22 08:55:52,705 INFO L591 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-10-22 08:55:52,705 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:55:52,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 238 transitions. [2019-10-22 08:55:52,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-10-22 08:55:52,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:52,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:52,707 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:52,707 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:52,707 INFO L791 eck$LassoCheckResult]: Stem: 5774#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 5775#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 5713#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 5714#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5743#L24-2 assume !!(main_~j~0 <= main_~r~0); 5859#L25 assume !(main_~j~0 < main_~r~0); 5858#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5917#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5916#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5734#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5735#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 5768#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5719#L4-30 assume !(0 == __VERIFIER_assert_~cond); 5720#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5750#L4-33 assume !(0 == __VERIFIER_assert_~cond); 5751#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 5790#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5724#L24-2 [2019-10-22 08:55:52,708 INFO L793 eck$LassoCheckResult]: Loop: 5724#L24-2 assume !!(main_~j~0 <= main_~r~0); 5752#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5753#L4 assume !(0 == __VERIFIER_assert_~cond); 5784#L4-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5778#L4-3 assume !(0 == __VERIFIER_assert_~cond); 5769#L4-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5727#L4-6 assume !(0 == __VERIFIER_assert_~cond); 5721#L4-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5715#L4-9 assume !(0 == __VERIFIER_assert_~cond); 5716#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 5746#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5747#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5738#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5732#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5733#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5765#L4-18 assume !(0 == __VERIFIER_assert_~cond); 5761#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5757#L4-21 assume !(0 == __VERIFIER_assert_~cond); 5758#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5781#L4-24 assume !(0 == __VERIFIER_assert_~cond); 5772#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5730#L4-27 assume !(0 == __VERIFIER_assert_~cond); 5723#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 5724#L24-2 [2019-10-22 08:55:52,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1925784365, now seen corresponding path program 1 times [2019-10-22 08:55:52,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051908273] [2019-10-22 08:55:52,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,721 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:52,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1855352395, now seen corresponding path program 2 times [2019-10-22 08:55:52,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621030212] [2019-10-22 08:55:52,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,737 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:52,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1823630071, now seen corresponding path program 1 times [2019-10-22 08:55:52,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198324701] [2019-10-22 08:55:52,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,760 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:52,924 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-10-22 08:55:52,925 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-10-22 08:55:53,348 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2019-10-22 08:55:53,349 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:53,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:53,349 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:53,349 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:53,349 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:53,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:53,350 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:53,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:53,350 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2019-10-22 08:55:53,350 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:53,350 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:53,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,422 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:53,422 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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) [2019-10-22 08:55:53,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:53,430 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c79354a4-5460-4e0f-a801-475b50a6fa99/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) [2019-10-22 08:55:53,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:53,442 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:53,549 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:53,551 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:53,551 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:53,551 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:53,551 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:53,551 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:53,551 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:53,552 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:53,552 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:53,552 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2019-10-22 08:55:53,552 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:53,552 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:53,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,615 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:53,615 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:53,615 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-10-22 08:55:53,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:53,615 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:53,616 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:53,616 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:53,616 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:53,616 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:53,616 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:53,617 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:53,620 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:53,620 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:53,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:53,620 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:53,621 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:53,621 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~r~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-10-22 08:55:53,621 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:53,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:53,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:53,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:55:53,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:53,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:53,726 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 08:55:53,726 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-10-22 08:55:53,843 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 408 states and 452 transitions. Complement of second has 13 states. [2019-10-22 08:55:53,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:55:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2019-10-22 08:55:53,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 17 letters. Loop has 23 letters. [2019-10-22 08:55:53,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:53,844 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:53,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:53,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:53,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:53,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:55:53,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:53,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:53,941 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 08:55:53,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-10-22 08:55:54,077 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 434 states and 478 transitions. Complement of second has 15 states. [2019-10-22 08:55:54,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:55:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2019-10-22 08:55:54,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 17 letters. Loop has 23 letters. [2019-10-22 08:55:54,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:54,079 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:54,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:54,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:54,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:55:54,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:54,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:54,174 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 08:55:54,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-10-22 08:55:54,302 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 811 states and 904 transitions. Complement of second has 13 states. [2019-10-22 08:55:54,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:55:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2019-10-22 08:55:54,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 104 transitions. Stem has 17 letters. Loop has 23 letters. [2019-10-22 08:55:54,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:54,308 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:54,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:54,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:54,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:55:54,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:54,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:54,403 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 08:55:54,403 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-10-22 08:55:54,527 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 699 states and 769 transitions. Complement of second has 14 states. [2019-10-22 08:55:54,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:55:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2019-10-22 08:55:54,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 17 letters. Loop has 23 letters. [2019-10-22 08:55:54,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:54,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 40 letters. Loop has 23 letters. [2019-10-22 08:55:54,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:54,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 17 letters. Loop has 46 letters. [2019-10-22 08:55:54,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:54,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 699 states and 769 transitions. [2019-10-22 08:55:54,533 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:54,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 699 states to 0 states and 0 transitions. [2019-10-22 08:55:54,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:54,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:54,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:54,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:54,533 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:54,533 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:54,534 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:54,534 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:55:54,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:54,534 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:54,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:55:54,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:54 BoogieIcfgContainer [2019-10-22 08:55:54,540 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:54,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:54,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:54,541 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:54,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:45" (3/4) ... [2019-10-22 08:55:54,544 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:54,544 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:54,546 INFO L168 Benchmark]: Toolchain (without parser) took 9933.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -200.7 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:54,547 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:54,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:54,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.09 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-10-22 08:55:54,550 INFO L168 Benchmark]: Boogie Preprocessor took 21.99 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-10-22 08:55:54,550 INFO L168 Benchmark]: RCFGBuilder took 296.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:54,551 INFO L168 Benchmark]: BuchiAutomizer took 9299.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.0 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:54,551 INFO L168 Benchmark]: Witness Printer took 3.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:54,553 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.09 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. * Boogie Preprocessor took 21.99 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. * RCFGBuilder took 296.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9299.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.0 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.89 ms. Allocated memory is still 1.3 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (8 trivial, 5 deterministic, 1 nondeterministic). One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 3 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function -4 * j + 5 * n and consists of 14 locations. One nondeterministic module has affine ranking function r + -1 * j and consists of 8 locations. 8 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.2s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 1.4s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 800 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 210 states and ocurred in iteration 8. Nontrivial modules had stage [4, 1, 0, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 819 SDtfs, 1416 SDslu, 950 SDs, 0 SdLazy, 1358 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT1 conc0 concLT5 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital37 mio100 ax100 hnf97 lsp74 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf93 smp97 dnf100 smp100 tf105 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...