./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/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.23-1dbac8b [2018-11-10 13:21:37,928 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:21:37,929 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:21:37,937 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:21:37,937 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:21:37,938 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:21:37,938 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:21:37,940 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:21:37,941 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:21:37,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:21:37,942 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:21:37,942 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:21:37,942 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:21:37,943 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:21:37,944 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:21:37,944 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:21:37,945 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:21:37,946 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:21:37,948 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:21:37,949 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:21:37,949 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:21:37,950 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:21:37,952 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:21:37,952 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:21:37,953 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:21:37,953 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:21:37,954 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:21:37,955 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:21:37,955 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:21:37,956 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:21:37,956 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:21:37,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:21:37,957 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:21:37,957 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:21:37,958 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:21:37,958 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:21:37,958 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 13:21:37,970 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:21:37,970 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:21:37,971 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:21:37,971 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:21:37,971 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:21:37,972 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:21:37,972 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:21:37,972 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:21:37,972 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:21:37,972 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:21:37,972 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:21:37,973 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:21:37,973 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:21:37,973 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:21:37,973 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:21:37,973 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:21:37,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:21:37,973 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:21:37,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:21:37,973 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:21:37,974 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:21:37,974 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:21:37,974 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:21:37,974 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:21:37,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:21:37,974 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:21:37,974 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:21:37,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:21:37,974 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:21:37,975 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:21:37,975 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:21:37,975 INFO L133 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_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/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 [2018-11-10 13:21:38,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:21:38,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:21:38,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:21:38,015 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:21:38,015 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:21:38,016 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-10 13:21:38,060 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/data/bfd9f6d42/d3fb687e4bdc4dc5ab22976bef850671/FLAG79e5aa24b [2018-11-10 13:21:38,450 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:21:38,450 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-10 13:21:38,454 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/data/bfd9f6d42/d3fb687e4bdc4dc5ab22976bef850671/FLAG79e5aa24b [2018-11-10 13:21:38,465 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/data/bfd9f6d42/d3fb687e4bdc4dc5ab22976bef850671 [2018-11-10 13:21:38,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:21:38,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:21:38,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:21:38,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:21:38,471 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:21:38,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:21:38" (1/1) ... [2018-11-10 13:21:38,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ca410a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38, skipping insertion in model container [2018-11-10 13:21:38,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:21:38" (1/1) ... [2018-11-10 13:21:38,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:21:38,493 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:21:38,582 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:21:38,584 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:21:38,596 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:21:38,604 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:21:38,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38 WrapperNode [2018-11-10 13:21:38,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:21:38,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:21:38,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:21:38,605 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:21:38,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38" (1/1) ... [2018-11-10 13:21:38,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38" (1/1) ... [2018-11-10 13:21:38,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:21:38,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:21:38,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:21:38,630 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:21:38,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38" (1/1) ... [2018-11-10 13:21:38,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38" (1/1) ... [2018-11-10 13:21:38,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38" (1/1) ... [2018-11-10 13:21:38,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38" (1/1) ... [2018-11-10 13:21:38,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38" (1/1) ... [2018-11-10 13:21:38,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38" (1/1) ... [2018-11-10 13:21:38,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38" (1/1) ... [2018-11-10 13:21:38,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:21:38,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:21:38,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:21:38,644 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:21:38,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/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 [2018-11-10 13:21:38,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:21:38,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:21:38,936 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:21:38,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:21:38 BoogieIcfgContainer [2018-11-10 13:21:38,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:21:38,937 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:21:38,937 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:21:38,940 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:21:38,940 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:21:38,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:21:38" (1/3) ... [2018-11-10 13:21:38,941 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@222d8113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:21:38, skipping insertion in model container [2018-11-10 13:21:38,941 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:21:38,941 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:38" (2/3) ... [2018-11-10 13:21:38,942 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@222d8113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:21:38, skipping insertion in model container [2018-11-10 13:21:38,942 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:21:38,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:21:38" (3/3) ... [2018-11-10 13:21:38,943 INFO L375 chiAutomizerObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-11-10 13:21:38,991 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:21:38,991 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:21:38,991 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:21:38,992 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:21:38,992 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:21:38,992 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:21:38,992 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:21:38,992 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:21:38,992 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:21:39,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2018-11-10 13:21:39,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-10 13:21:39,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:21:39,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:21:39,025 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:21:39,025 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:39,025 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:21:39,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2018-11-10 13:21:39,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-10 13:21:39,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:21:39,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:21:39,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:21:39,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:39,032 INFO L793 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 59#L13true assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := (if main_~n~0 < 0 && main_~n~0 % 2 != 0 then main_~n~0 / 2 + 1 else main_~n~0 / 2) + 1;main_~r~0 := main_~n~0; 34#L16true assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 44#L45-1true [2018-11-10 13:21:39,032 INFO L795 eck$LassoCheckResult]: Loop: 44#L45-1true assume true; 7#L21true assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 56#L24-3true assume !true; 38#L24-4true assume main_~l~0 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 35#L4-30true assume !(__VERIFIER_assert_~cond == 0); 48#L4-32true assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 46#L4-33true assume !(__VERIFIER_assert_~cond == 0); 43#L4-35true assume { :end_inline___VERIFIER_assert } true;main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 44#L45-1true [2018-11-10 13:21:39,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:39,036 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-10 13:21:39,037 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:39,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:39,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:39,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:39,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1436294447, now seen corresponding path program 1 times [2018-11-10 13:21:39,115 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:39,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:39,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:39,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:39,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:39,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:21:39,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:21:39,138 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:21:39,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:21:39,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:21:39,148 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-11-10 13:21:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:39,154 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-10 13:21:39,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:21:39,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 66 transitions. [2018-11-10 13:21:39,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-10 13:21:39,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 41 states and 47 transitions. [2018-11-10 13:21:39,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 13:21:39,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 13:21:39,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-11-10 13:21:39,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:21:39,161 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 13:21:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-11-10 13:21:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 13:21:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 13:21:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-10 13:21:39,179 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 13:21:39,179 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 13:21:39,179 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:21:39,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2018-11-10 13:21:39,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-10 13:21:39,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:21:39,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:21:39,181 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:21:39,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:39,181 INFO L793 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 140#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := (if main_~n~0 < 0 && main_~n~0 % 2 != 0 then main_~n~0 / 2 + 1 else main_~n~0 / 2) + 1;main_~r~0 := main_~n~0; 126#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 127#L45-1 [2018-11-10 13:21:39,181 INFO L795 eck$LassoCheckResult]: Loop: 127#L45-1 assume true; 141#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 134#L24-3 assume true; 162#L24-1 assume !(main_~j~0 <= main_~r~0); 137#L24-4 assume main_~l~0 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 130#L4-30 assume !(__VERIFIER_assert_~cond == 0); 131#L4-32 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 149#L4-33 assume !(__VERIFIER_assert_~cond == 0); 146#L4-35 assume { :end_inline___VERIFIER_assert } true;main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 127#L45-1 [2018-11-10 13:21:39,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:39,181 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-10 13:21:39,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:39,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:39,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:39,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:39,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:39,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1050635401, now seen corresponding path program 1 times [2018-11-10 13:21:39,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:39,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:39,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:39,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:21:39,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:39,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:39,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1141532528, now seen corresponding path program 1 times [2018-11-10 13:21:39,209 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:39,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:39,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:39,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:39,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:39,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:21:39,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:21:39,399 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:39,400 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:39,400 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:39,400 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:39,400 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:21:39,401 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:39,401 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:39,401 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:39,401 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-10 13:21:39,401 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:39,401 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:39,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:39,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:39,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:39,484 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:39,485 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:39,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:39,492 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:39,526 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:21:39,526 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:39,808 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:21:39,809 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:39,809 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:39,810 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:39,810 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:39,810 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:21:39,810 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:39,810 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:39,810 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:39,810 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-10 13:21:39,810 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:39,810 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:39,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:39,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:39,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:39,860 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:39,863 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:21:39,864 INFO L122 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 [2018-11-10 13:21:39,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:39,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:39,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:39,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:39,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:39,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:39,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:39,869 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:21:39,869 INFO L122 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 [2018-11-10 13:21:39,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:39,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:39,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:39,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:39,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:39,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:39,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:39,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:21:39,875 INFO L122 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 [2018-11-10 13:21:39,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:39,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:39,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:39,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:39,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:39,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:39,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:39,884 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:21:39,892 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 13:21:39,892 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 13:21:39,894 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:21:39,894 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 13:21:39,894 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:21:39,895 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2018-11-10 13:21:39,895 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 13:21:39,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:39,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:39,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:39,979 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 [2018-11-10 13:21:39,980 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 13:21:40,021 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 118 states and 135 transitions. Complement of second has 6 states. [2018-11-10 13:21:40,022 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 [2018-11-10 13:21:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 13:21:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2018-11-10 13:21:40,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-10 13:21:40,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:40,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-10 13:21:40,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:40,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-10 13:21:40,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:40,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 135 transitions. [2018-11-10 13:21:40,029 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 70 [2018-11-10 13:21:40,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 114 states and 131 transitions. [2018-11-10 13:21:40,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-10 13:21:40,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-10 13:21:40,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 131 transitions. [2018-11-10 13:21:40,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:21:40,031 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 131 transitions. [2018-11-10 13:21:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 131 transitions. [2018-11-10 13:21:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-11-10 13:21:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-10 13:21:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2018-11-10 13:21:40,037 INFO L728 BuchiCegarLoop]: Abstraction has 113 states and 130 transitions. [2018-11-10 13:21:40,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:21:40,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:21:40,038 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 3 states. [2018-11-10 13:21:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:40,059 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2018-11-10 13:21:40,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:21:40,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 156 transitions. [2018-11-10 13:21:40,060 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 99 [2018-11-10 13:21:40,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 104 states and 118 transitions. [2018-11-10 13:21:40,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2018-11-10 13:21:40,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2018-11-10 13:21:40,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 118 transitions. [2018-11-10 13:21:40,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:21:40,062 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 118 transitions. [2018-11-10 13:21:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 118 transitions. [2018-11-10 13:21:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 70. [2018-11-10 13:21:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 13:21:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-11-10 13:21:40,065 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-10 13:21:40,065 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-10 13:21:40,065 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:21:40,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 80 transitions. [2018-11-10 13:21:40,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2018-11-10 13:21:40,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:21:40,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:21:40,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:21:40,067 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:40,067 INFO L793 eck$LassoCheckResult]: Stem: 636#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 612#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 613#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := (if main_~n~0 < 0 && main_~n~0 % 2 != 0 then main_~n~0 / 2 + 1 else main_~n~0 / 2) + 1;main_~r~0 := main_~n~0; 598#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 599#L45-1 [2018-11-10 13:21:40,067 INFO L795 eck$LassoCheckResult]: Loop: 599#L45-1 assume true; 648#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 646#L24-3 assume true; 643#L24-1 assume !(main_~j~0 <= main_~r~0); 640#L24-4 assume main_~l~0 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 603#L4-30 assume !(__VERIFIER_assert_~cond == 0); 604#L4-32 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 622#L4-33 assume !(__VERIFIER_assert_~cond == 0); 619#L4-35 assume { :end_inline___VERIFIER_assert } true;main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 599#L45-1 [2018-11-10 13:21:40,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2018-11-10 13:21:40,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:40,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:40,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:40,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:40,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:40,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1050635401, now seen corresponding path program 2 times [2018-11-10 13:21:40,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:40,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:40,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:40,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:40,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:40,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1534559538, now seen corresponding path program 1 times [2018-11-10 13:21:40,084 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:40,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:40,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:40,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:21:40,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:40,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:21:40,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:21:40,199 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:40,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:40,200 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:40,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:40,200 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:21:40,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:40,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:40,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:40,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-10 13:21:40,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:40,200 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:40,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:40,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:40,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:40,267 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:40,267 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/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 [2018-11-10 13:21:40,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:40,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:40,271 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:21:40,272 INFO L446 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_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/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 [2018-11-10 13:21:40,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:40,288 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:40,306 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:21:40,306 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:40,602 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:21:40,603 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:40,603 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:40,603 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:40,604 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:40,604 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:21:40,604 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:40,604 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:40,604 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:40,604 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-10 13:21:40,604 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:40,604 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:40,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:40,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:40,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:40,665 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:40,665 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:21:40,665 INFO L122 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 [2018-11-10 13:21:40,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:40,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:40,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:40,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:40,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:40,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:40,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:40,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:21:40,671 INFO L122 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 [2018-11-10 13:21:40,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:40,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:40,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:40,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:40,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:40,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:40,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:40,676 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:21:40,680 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 13:21:40,681 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 13:21:40,681 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:21:40,681 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 13:21:40,681 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:21:40,684 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2018-11-10 13:21:40,684 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 13:21:40,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:40,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:40,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:40,714 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 [2018-11-10 13:21:40,714 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 80 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 13:21:40,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 80 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 169 states and 193 transitions. Complement of second has 6 states. [2018-11-10 13:21:40,736 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 [2018-11-10 13:21:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 13:21:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2018-11-10 13:21:40,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-10 13:21:40,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:40,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-10 13:21:40,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:40,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-10 13:21:40,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:40,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 193 transitions. [2018-11-10 13:21:40,739 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 92 [2018-11-10 13:21:40,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 132 states and 151 transitions. [2018-11-10 13:21:40,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2018-11-10 13:21:40,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2018-11-10 13:21:40,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 151 transitions. [2018-11-10 13:21:40,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:21:40,741 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 151 transitions. [2018-11-10 13:21:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 151 transitions. [2018-11-10 13:21:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 71. [2018-11-10 13:21:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 13:21:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2018-11-10 13:21:40,748 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 82 transitions. [2018-11-10 13:21:40,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:21:40,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:21:40,748 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 5 states. [2018-11-10 13:21:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:40,879 INFO L93 Difference]: Finished difference Result 219 states and 243 transitions. [2018-11-10 13:21:40,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:21:40,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 243 transitions. [2018-11-10 13:21:40,881 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 132 [2018-11-10 13:21:40,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 219 states and 243 transitions. [2018-11-10 13:21:40,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2018-11-10 13:21:40,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2018-11-10 13:21:40,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 243 transitions. [2018-11-10 13:21:40,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:21:40,884 INFO L705 BuchiCegarLoop]: Abstraction has 219 states and 243 transitions. [2018-11-10 13:21:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 243 transitions. [2018-11-10 13:21:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 76. [2018-11-10 13:21:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 13:21:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-11-10 13:21:40,889 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-11-10 13:21:40,889 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-11-10 13:21:40,889 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 13:21:40,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 87 transitions. [2018-11-10 13:21:40,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-10 13:21:40,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:21:40,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:21:40,890 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:21:40,890 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:40,890 INFO L793 eck$LassoCheckResult]: Stem: 1262#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1219#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := (if main_~n~0 < 0 && main_~n~0 % 2 != 0 then main_~n~0 / 2 + 1 else main_~n~0 / 2) + 1;main_~r~0 := main_~n~0; 1196#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 1198#L45-1 [2018-11-10 13:21:40,891 INFO L795 eck$LassoCheckResult]: Loop: 1198#L45-1 assume true; 1224#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1208#L24-3 assume true; 1260#L24-1 assume !(main_~j~0 <= main_~r~0); 1215#L24-4 assume !(main_~l~0 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1216#L4-36 assume !(__VERIFIER_assert_~cond == 0); 1227#L4-38 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 1253#L4-39 assume !(__VERIFIER_assert_~cond == 0); 1250#L4-41 assume { :end_inline___VERIFIER_assert } true;main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1198#L45-1 [2018-11-10 13:21:40,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2018-11-10 13:21:40,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:40,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:40,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:40,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:40,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1029640691, now seen corresponding path program 1 times [2018-11-10 13:21:40,899 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:40,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:40,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:40,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:21:40,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:40,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:21:40,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:21:40,914 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:21:40,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:21:40,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:21:40,915 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-10 13:21:40,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:40,978 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2018-11-10 13:21:40,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:21:40,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 154 transitions. [2018-11-10 13:21:40,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2018-11-10 13:21:40,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 136 states and 153 transitions. [2018-11-10 13:21:40,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-10 13:21:40,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-10 13:21:40,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 153 transitions. [2018-11-10 13:21:40,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:21:40,981 INFO L705 BuchiCegarLoop]: Abstraction has 136 states and 153 transitions. [2018-11-10 13:21:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 153 transitions. [2018-11-10 13:21:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 75. [2018-11-10 13:21:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 13:21:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-11-10 13:21:40,989 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-11-10 13:21:40,989 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-11-10 13:21:40,989 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 13:21:40,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 86 transitions. [2018-11-10 13:21:40,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-10 13:21:40,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:21:40,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:21:40,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:21:40,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:40,990 INFO L793 eck$LassoCheckResult]: Stem: 1484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1440#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1441#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := (if main_~n~0 < 0 && main_~n~0 % 2 != 0 then main_~n~0 / 2 + 1 else main_~n~0 / 2) + 1;main_~r~0 := main_~n~0; 1418#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 1420#L45-1 [2018-11-10 13:21:40,991 INFO L795 eck$LassoCheckResult]: Loop: 1420#L45-1 assume true; 1442#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1443#L24-3 assume true; 1482#L24-1 assume !!(main_~j~0 <= main_~r~0); 1460#L25 assume !(main_~j~0 < main_~r~0); 1455#L25-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1456#L4-12 assume !(__VERIFIER_assert_~cond == 0); 1451#L4-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 1446#L4-15 assume !(__VERIFIER_assert_~cond == 0); 1447#L4-17 assume { :end_inline___VERIFIER_assert } true; 1476#L35 assume main_#t~nondet5 != 0;havoc main_#t~nondet5; 1437#L24-4 assume !(main_~l~0 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1438#L4-36 assume !(__VERIFIER_assert_~cond == 0); 1450#L4-38 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 1475#L4-39 assume !(__VERIFIER_assert_~cond == 0); 1472#L4-41 assume { :end_inline___VERIFIER_assert } true;main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1420#L45-1 [2018-11-10 13:21:40,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2018-11-10 13:21:40,991 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:40,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:40,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:40,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:40,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:40,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:40,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2054214721, now seen corresponding path program 1 times [2018-11-10 13:21:40,999 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:40,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:21:41,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:41,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:41,010 INFO L82 PathProgramCache]: Analyzing trace with hash -106412504, now seen corresponding path program 1 times [2018-11-10 13:21:41,010 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:41,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:41,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:41,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:41,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:21:41,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:21:41,188 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:41,188 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:41,188 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:41,188 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:41,188 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:21:41,188 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:41,188 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:41,188 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:41,188 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-10 13:21:41,189 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:41,189 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:41,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,270 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:41,270 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:41,272 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:41,272 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:41,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:21:41,301 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:41,323 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:21:41,324 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:41,324 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:41,324 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:41,324 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:41,325 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:21:41,325 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:41,325 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:41,325 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:41,325 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-10 13:21:41,325 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:41,325 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:41,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,391 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:41,391 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:21:41,391 INFO L122 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 [2018-11-10 13:21:41,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:41,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:41,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:41,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:41,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:41,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:41,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:41,396 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:21:41,399 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 13:21:41,399 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 13:21:41,399 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:21:41,399 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 13:21:41,399 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:21:41,399 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2018-11-10 13:21:41,400 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 13:21:41,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:41,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:41,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:41,432 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 [2018-11-10 13:21:41,432 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 86 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-10 13:21:41,454 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 86 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 145 states and 165 transitions. Complement of second has 6 states. [2018-11-10 13:21:41,454 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 [2018-11-10 13:21:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 13:21:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2018-11-10 13:21:41,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 4 letters. Loop has 16 letters. [2018-11-10 13:21:41,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:41,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 20 letters. Loop has 16 letters. [2018-11-10 13:21:41,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:41,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 4 letters. Loop has 32 letters. [2018-11-10 13:21:41,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:41,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 165 transitions. [2018-11-10 13:21:41,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-11-10 13:21:41,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 140 states and 159 transitions. [2018-11-10 13:21:41,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-10 13:21:41,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-11-10 13:21:41,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 159 transitions. [2018-11-10 13:21:41,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:21:41,458 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-11-10 13:21:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 159 transitions. [2018-11-10 13:21:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-11-10 13:21:41,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-10 13:21:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2018-11-10 13:21:41,462 INFO L728 BuchiCegarLoop]: Abstraction has 138 states and 157 transitions. [2018-11-10 13:21:41,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:21:41,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:21:41,463 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand 5 states. [2018-11-10 13:21:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:41,488 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-11-10 13:21:41,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:21:41,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 92 transitions. [2018-11-10 13:21:41,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-10 13:21:41,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 75 states and 85 transitions. [2018-11-10 13:21:41,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 13:21:41,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 13:21:41,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 85 transitions. [2018-11-10 13:21:41,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:21:41,490 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-10 13:21:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 85 transitions. [2018-11-10 13:21:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-10 13:21:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 13:21:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-11-10 13:21:41,492 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-10 13:21:41,492 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-10 13:21:41,492 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 13:21:41,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 85 transitions. [2018-11-10 13:21:41,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-10 13:21:41,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:21:41,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:21:41,493 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 13:21:41,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:41,494 INFO L793 eck$LassoCheckResult]: Stem: 2012#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1967#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1968#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := (if main_~n~0 < 0 && main_~n~0 % 2 != 0 then main_~n~0 / 2 + 1 else main_~n~0 / 2) + 1;main_~r~0 := main_~n~0; 1946#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 1947#L45-1 assume true; 1969#L21 [2018-11-10 13:21:41,494 INFO L795 eck$LassoCheckResult]: Loop: 1969#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1970#L24-3 assume true; 2010#L24-1 assume !!(main_~j~0 <= main_~r~0); 1988#L25 assume !(main_~j~0 < main_~r~0); 1983#L25-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1984#L4-12 assume !(__VERIFIER_assert_~cond == 0); 1978#L4-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 1973#L4-15 assume !(__VERIFIER_assert_~cond == 0); 1974#L4-17 assume { :end_inline___VERIFIER_assert } true; 2004#L35 assume main_#t~nondet5 != 0;havoc main_#t~nondet5; 1964#L24-4 assume !(main_~l~0 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1965#L4-36 assume !(__VERIFIER_assert_~cond == 0); 1977#L4-38 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 2003#L4-39 assume !(__VERIFIER_assert_~cond == 0); 2000#L4-41 assume { :end_inline___VERIFIER_assert } true;main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1982#L45-1 assume true; 1969#L21 [2018-11-10 13:21:41,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash 28695786, now seen corresponding path program 1 times [2018-11-10 13:21:41,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:41,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:41,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:41,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:41,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:41,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1428410305, now seen corresponding path program 2 times [2018-11-10 13:21:41,502 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:41,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:41,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:41,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:41,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:41,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1304642902, now seen corresponding path program 1 times [2018-11-10 13:21:41,512 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:41,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:41,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:21:41,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:41,672 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:41,672 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:41,672 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:41,672 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:41,672 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:21:41,673 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:41,673 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:41,673 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:41,673 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-10 13:21:41,673 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:41,673 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:41,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,753 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:41,753 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/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 [2018-11-10 13:21:41,760 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:41,760 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:41,763 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:21:41,763 INFO L446 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_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/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 [2018-11-10 13:21:41,780 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:41,780 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:41,781 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:21:41,781 INFO L446 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_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/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 [2018-11-10 13:21:41,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:41,798 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:41,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:21:41,816 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:41,851 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:21:41,853 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:41,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:41,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:41,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:41,853 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:21:41,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:41,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:41,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:41,853 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-10 13:21:41,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:41,854 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:41,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:41,912 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:41,912 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:21:41,913 INFO L122 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 [2018-11-10 13:21:41,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:41,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:41,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:41,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:41,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:41,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:41,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:41,917 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:21:41,918 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 13:21:41,918 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 13:21:41,919 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:21:41,919 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 13:21:41,919 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:21:41,919 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2018-11-10 13:21:41,919 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 13:21:41,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:41,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:41,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:41,955 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 13:21:41,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 85 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 13:21:41,967 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 85 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 149 states and 170 transitions. Complement of second has 6 states. [2018-11-10 13:21:41,968 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 [2018-11-10 13:21:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 13:21:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-10 13:21:41,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-10 13:21:41,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:41,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 21 letters. Loop has 16 letters. [2018-11-10 13:21:41,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:41,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 5 letters. Loop has 32 letters. [2018-11-10 13:21:41,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:41,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 170 transitions. [2018-11-10 13:21:41,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 13:21:41,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 144 states and 164 transitions. [2018-11-10 13:21:41,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 13:21:41,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 13:21:41,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 164 transitions. [2018-11-10 13:21:41,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:21:41,970 INFO L705 BuchiCegarLoop]: Abstraction has 144 states and 164 transitions. [2018-11-10 13:21:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 164 transitions. [2018-11-10 13:21:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-11-10 13:21:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-10 13:21:41,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 160 transitions. [2018-11-10 13:21:41,974 INFO L728 BuchiCegarLoop]: Abstraction has 140 states and 160 transitions. [2018-11-10 13:21:41,974 INFO L608 BuchiCegarLoop]: Abstraction has 140 states and 160 transitions. [2018-11-10 13:21:41,974 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 13:21:41,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 160 transitions. [2018-11-10 13:21:41,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 13:21:41,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:21:41,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:21:41,975 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 13:21:41,975 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:41,975 INFO L793 eck$LassoCheckResult]: Stem: 2329#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 2279#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := (if main_~n~0 < 0 && main_~n~0 % 2 != 0 then main_~n~0 / 2 + 1 else main_~n~0 / 2) + 1;main_~r~0 := main_~n~0; 2257#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2258#L45-1 assume true; 2294#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2268#L24-3 [2018-11-10 13:21:41,975 INFO L795 eck$LassoCheckResult]: Loop: 2268#L24-3 assume true; 2327#L24-1 assume !!(main_~j~0 <= main_~r~0); 2303#L25 assume !(main_~j~0 < main_~r~0); 2298#L25-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2299#L4-12 assume !(__VERIFIER_assert_~cond == 0); 2289#L4-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 2283#L4-15 assume !(__VERIFIER_assert_~cond == 0); 2284#L4-17 assume { :end_inline___VERIFIER_assert } true; 2321#L35 assume !(main_#t~nondet5 != 0);havoc main_#t~nondet5;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2318#L4-18 assume !(__VERIFIER_assert_~cond == 0); 2314#L4-20 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 2310#L4-21 assume !(__VERIFIER_assert_~cond == 0); 2311#L4-23 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2332#L4-24 assume !(__VERIFIER_assert_~cond == 0); 2325#L4-26 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 2273#L4-27 assume !(__VERIFIER_assert_~cond == 0); 2267#L4-29 assume { :end_inline___VERIFIER_assert } true;main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2268#L24-3 [2018-11-10 13:21:41,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash 889569388, now seen corresponding path program 1 times [2018-11-10 13:21:41,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:41,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:41,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:41,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:41,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash 997435947, now seen corresponding path program 1 times [2018-11-10 13:21:41,981 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:41,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:41,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:41,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:41,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:41,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1549832928, now seen corresponding path program 1 times [2018-11-10 13:21:41,990 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:41,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:41,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:41,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:42,082 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 13:21:42,142 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:42,142 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:42,142 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:42,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:42,142 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:21:42,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:42,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:42,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:42,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration7_Loop [2018-11-10 13:21:42,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:42,143 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:42,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:42,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:42,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:42,184 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:42,184 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:42,187 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:42,187 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:42,189 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:21:42,189 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:42,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:42,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:42,208 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:21:42,208 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:42,223 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:42,223 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:42,242 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:21:42,243 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:42,324 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:21:42,326 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:42,326 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:42,326 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:42,326 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:42,326 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:21:42,326 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:42,326 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:42,326 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:42,326 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration7_Loop [2018-11-10 13:21:42,326 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:42,326 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:42,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:42,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:42,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:42,368 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:42,368 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:21:42,368 INFO L122 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 [2018-11-10 13:21:42,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:42,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:42,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:42,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:42,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:42,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:42,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:42,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:21:42,372 INFO L122 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 [2018-11-10 13:21:42,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:42,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:42,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:42,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:42,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:42,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:42,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:42,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:21:42,373 INFO L122 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 [2018-11-10 13:21:42,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:42,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:42,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:42,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:42,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:42,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:42,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:42,377 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:21:42,380 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 13:21:42,380 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 13:21:42,380 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:21:42,380 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 13:21:42,380 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:21:42,380 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~r~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-10 13:21:42,381 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 13:21:42,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:42,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:42,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:42,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-10 13:21:42,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 160 transitions. cyclomatic complexity: 24 Second operand 6 states. [2018-11-10 13:21:42,571 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 160 transitions. cyclomatic complexity: 24. Second operand 6 states. Result 567 states and 624 transitions. Complement of second has 13 states. [2018-11-10 13:21:42,572 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 [2018-11-10 13:21:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 13:21:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-10 13:21:42,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 75 transitions. Stem has 6 letters. Loop has 17 letters. [2018-11-10 13:21:42,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:42,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 75 transitions. Stem has 23 letters. Loop has 17 letters. [2018-11-10 13:21:42,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:42,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 75 transitions. Stem has 6 letters. Loop has 34 letters. [2018-11-10 13:21:42,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:42,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 624 transitions. [2018-11-10 13:21:42,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 13:21:42,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 401 states and 448 transitions. [2018-11-10 13:21:42,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-10 13:21:42,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-10 13:21:42,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 448 transitions. [2018-11-10 13:21:42,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:21:42,583 INFO L705 BuchiCegarLoop]: Abstraction has 401 states and 448 transitions. [2018-11-10 13:21:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 448 transitions. [2018-11-10 13:21:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 285. [2018-11-10 13:21:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-10 13:21:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 323 transitions. [2018-11-10 13:21:42,588 INFO L728 BuchiCegarLoop]: Abstraction has 285 states and 323 transitions. [2018-11-10 13:21:42,589 INFO L608 BuchiCegarLoop]: Abstraction has 285 states and 323 transitions. [2018-11-10 13:21:42,589 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 13:21:42,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 285 states and 323 transitions. [2018-11-10 13:21:42,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 13:21:42,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:21:42,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:21:42,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:42,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:42,591 INFO L793 eck$LassoCheckResult]: Stem: 3142#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3089#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 3090#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := (if main_~n~0 < 0 && main_~n~0 % 2 != 0 then main_~n~0 / 2 + 1 else main_~n~0 / 2) + 1;main_~r~0 := main_~n~0; 3069#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 3070#L45-1 assume true; 3105#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 3139#L24-3 assume true; 3140#L24-1 assume !!(main_~j~0 <= main_~r~0); 3167#L25 assume main_~j~0 < main_~r~0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3166#L4 assume !(__VERIFIER_assert_~cond == 0); 3165#L4-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 3164#L4-3 assume !(__VERIFIER_assert_~cond == 0); 3163#L4-5 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 + 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3162#L4-6 assume !(__VERIFIER_assert_~cond == 0); 3161#L4-8 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~j~0 + 1 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3160#L4-9 assume !(__VERIFIER_assert_~cond == 0); 3159#L4-11 assume { :end_inline___VERIFIER_assert } true; 3156#L30 assume main_#t~nondet4 != 0;havoc main_#t~nondet4;main_~j~0 := main_~j~0 + 1; 3109#L25-1 [2018-11-10 13:21:42,591 INFO L795 eck$LassoCheckResult]: Loop: 3109#L25-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3110#L4-12 assume !(__VERIFIER_assert_~cond == 0); 3101#L4-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 3095#L4-15 assume !(__VERIFIER_assert_~cond == 0); 3096#L4-17 assume { :end_inline___VERIFIER_assert } true; 3133#L35 assume !(main_#t~nondet5 != 0);havoc main_#t~nondet5;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3130#L4-18 assume !(__VERIFIER_assert_~cond == 0); 3126#L4-20 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 3122#L4-21 assume !(__VERIFIER_assert_~cond == 0); 3123#L4-23 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3145#L4-24 assume !(__VERIFIER_assert_~cond == 0); 3137#L4-26 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 3085#L4-27 assume !(__VERIFIER_assert_~cond == 0); 3079#L4-29 assume { :end_inline___VERIFIER_assert } true;main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 3080#L24-3 assume true; 3147#L24-1 assume !!(main_~j~0 <= main_~r~0); 3115#L25 assume !(main_~j~0 < main_~r~0); 3109#L25-1 [2018-11-10 13:21:42,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:42,591 INFO L82 PathProgramCache]: Analyzing trace with hash 978197297, now seen corresponding path program 1 times [2018-11-10 13:21:42,591 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:42,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:42,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:42,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:42,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:42,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:42,603 INFO L82 PathProgramCache]: Analyzing trace with hash 972596877, now seen corresponding path program 2 times [2018-11-10 13:21:42,603 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:42,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:42,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:42,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:42,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:42,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:42,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1671319901, now seen corresponding path program 1 times [2018-11-10 13:21:42,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:42,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:42,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:21:42,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:42,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:42,661 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:21:42,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:42,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:42,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:21:42,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2018-11-10 13:21:42,940 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 13:21:42,962 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:42,962 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:42,962 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:42,962 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:42,962 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:21:42,962 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:42,962 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:42,962 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:42,962 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2018-11-10 13:21:42,962 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:42,962 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:42,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:42,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:42,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:43,009 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:43,009 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:43,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:43,011 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:43,016 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:21:43,016 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:43,032 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:43,033 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:43,035 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:21:43,035 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:43,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:43,061 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:43,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:21:43,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:43,181 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:21:43,182 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:43,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:43,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:43,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:43,182 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:21:43,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:43,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:43,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:43,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2018-11-10 13:21:43,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:43,183 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:43,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:43,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:43,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:43,245 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:43,245 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:21:43,245 INFO L122 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 [2018-11-10 13:21:43,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:43,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:43,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:43,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:43,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:43,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:43,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:43,247 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:21:43,247 INFO L122 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 [2018-11-10 13:21:43,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:43,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:43,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:43,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:43,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:43,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:43,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:43,250 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:21:43,253 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 13:21:43,254 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 13:21:43,254 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:21:43,254 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 13:21:43,254 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:21:43,254 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~j~0 + 3*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-10 13:21:43,254 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 13:21:43,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:43,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:43,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:43,334 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 13:21:43,335 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 285 states and 323 transitions. cyclomatic complexity: 46 Second operand 7 states. [2018-11-10 13:21:43,451 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 285 states and 323 transitions. cyclomatic complexity: 46. Second operand 7 states. Result 752 states and 838 transitions. Complement of second has 15 states. [2018-11-10 13:21:43,451 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 [2018-11-10 13:21:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 13:21:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2018-11-10 13:21:43,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 103 transitions. Stem has 18 letters. Loop has 17 letters. [2018-11-10 13:21:43,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:43,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 103 transitions. Stem has 35 letters. Loop has 17 letters. [2018-11-10 13:21:43,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:43,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 103 transitions. Stem has 18 letters. Loop has 34 letters. [2018-11-10 13:21:43,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:43,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 752 states and 838 transitions. [2018-11-10 13:21:43,456 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2018-11-10 13:21:43,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 752 states to 593 states and 668 transitions. [2018-11-10 13:21:43,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-11-10 13:21:43,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-11-10 13:21:43,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 593 states and 668 transitions. [2018-11-10 13:21:43,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:21:43,459 INFO L705 BuchiCegarLoop]: Abstraction has 593 states and 668 transitions. [2018-11-10 13:21:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states and 668 transitions. [2018-11-10 13:21:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 523. [2018-11-10 13:21:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-11-10 13:21:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 592 transitions. [2018-11-10 13:21:43,469 INFO L728 BuchiCegarLoop]: Abstraction has 523 states and 592 transitions. [2018-11-10 13:21:43,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 13:21:43,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:21:43,470 INFO L87 Difference]: Start difference. First operand 523 states and 592 transitions. Second operand 12 states. [2018-11-10 13:21:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:44,625 INFO L93 Difference]: Finished difference Result 968 states and 1068 transitions. [2018-11-10 13:21:44,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:21:44,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 968 states and 1068 transitions. [2018-11-10 13:21:44,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2018-11-10 13:21:44,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 968 states to 666 states and 742 transitions. [2018-11-10 13:21:44,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-10 13:21:44,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-10 13:21:44,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 666 states and 742 transitions. [2018-11-10 13:21:44,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:21:44,632 INFO L705 BuchiCegarLoop]: Abstraction has 666 states and 742 transitions. [2018-11-10 13:21:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states and 742 transitions. [2018-11-10 13:21:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 564. [2018-11-10 13:21:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-11-10 13:21:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 630 transitions. [2018-11-10 13:21:44,641 INFO L728 BuchiCegarLoop]: Abstraction has 564 states and 630 transitions. [2018-11-10 13:21:44,641 INFO L608 BuchiCegarLoop]: Abstraction has 564 states and 630 transitions. [2018-11-10 13:21:44,641 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 13:21:44,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 564 states and 630 transitions. [2018-11-10 13:21:44,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2018-11-10 13:21:44,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:21:44,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:21:44,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:44,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:44,644 INFO L793 eck$LassoCheckResult]: Stem: 5957#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5886#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 5887#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := (if main_~n~0 < 0 && main_~n~0 % 2 != 0 then main_~n~0 / 2 + 1 else main_~n~0 / 2) + 1;main_~r~0 := main_~n~0; 5864#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 5865#L45-1 assume true; 5903#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 6228#L24-3 assume true; 6229#L24-1 assume !!(main_~j~0 <= main_~r~0); 6420#L25 assume !(main_~j~0 < main_~r~0); 5908#L25-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5909#L4-12 assume !(__VERIFIER_assert_~cond == 0); 5899#L4-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 5900#L4-15 assume !(__VERIFIER_assert_~cond == 0); 5939#L4-17 assume { :end_inline___VERIFIER_assert } true; 5940#L35 assume main_#t~nondet5 != 0;havoc main_#t~nondet5; 5885#L24-4 assume main_~l~0 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5870#L4-30 assume !(__VERIFIER_assert_~cond == 0); 5871#L4-32 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 5914#L4-33 assume !(__VERIFIER_assert_~cond == 0); 5901#L4-35 assume { :end_inline___VERIFIER_assert } true;main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 5902#L45-1 assume true; 5985#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5876#L24-3 [2018-11-10 13:21:44,644 INFO L795 eck$LassoCheckResult]: Loop: 5876#L24-3 assume true; 5982#L24-1 assume !!(main_~j~0 <= main_~r~0); 5981#L25 assume !(main_~j~0 < main_~r~0); 5942#L25-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5910#L4-12 assume !(__VERIFIER_assert_~cond == 0); 5911#L4-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 5988#L4-15 assume !(__VERIFIER_assert_~cond == 0); 5937#L4-17 assume { :end_inline___VERIFIER_assert } true; 5938#L35 assume !(main_#t~nondet5 != 0);havoc main_#t~nondet5;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5932#L4-18 assume !(__VERIFIER_assert_~cond == 0); 5933#L4-20 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 5922#L4-21 assume !(__VERIFIER_assert_~cond == 0); 5923#L4-23 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5961#L4-24 assume !(__VERIFIER_assert_~cond == 0); 5962#L4-26 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__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; 5882#L4-27 assume !(__VERIFIER_assert_~cond == 0); 5875#L4-29 assume { :end_inline___VERIFIER_assert } true;main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 5876#L24-3 [2018-11-10 13:21:44,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash -490304106, now seen corresponding path program 1 times [2018-11-10 13:21:44,644 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:44,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:44,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:44,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:44,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:44,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:44,655 INFO L82 PathProgramCache]: Analyzing trace with hash 997435947, now seen corresponding path program 3 times [2018-11-10 13:21:44,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:44,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:44,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:44,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:44,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:44,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:44,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1071733046, now seen corresponding path program 1 times [2018-11-10 13:21:44,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:21:44,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:21:44,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:44,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:21:44,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:44,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:44,705 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:21:44,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:44,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:44,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:21:44,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 13:21:44,823 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 13:21:44,838 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:44,838 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:44,838 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:44,838 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:44,838 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:21:44,838 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:44,838 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:44,838 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:44,838 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2018-11-10 13:21:44,838 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:44,839 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:44,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:44,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:44,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:44,884 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:44,884 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:44,886 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:21:44,887 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d30066fb-ee68-474e-b31b-14faa366e693/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:44,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:21:44,905 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:21:44,979 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:21:44,981 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:21:44,981 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:21:44,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:21:44,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:21:44,981 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:21:44,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:21:44,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:21:44,981 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:21:44,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2018-11-10 13:21:44,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:21:44,981 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:21:44,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:44,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:44,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:21:45,026 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:21:45,026 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:21:45,026 INFO L122 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 [2018-11-10 13:21:45,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:21:45,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:21:45,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:21:45,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:21:45,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:21:45,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:21:45,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:21:45,029 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:21:45,032 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 13:21:45,032 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 13:21:45,032 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:21:45,033 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 13:21:45,033 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:21:45,033 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~n~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-10 13:21:45,033 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 13:21:45,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:45,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:45,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:45,105 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 [2018-11-10 13:21:45,105 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 564 states and 630 transitions. cyclomatic complexity: 77 Second operand 7 states. [2018-11-10 13:21:45,196 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 564 states and 630 transitions. cyclomatic complexity: 77. Second operand 7 states. Result 894 states and 976 transitions. Complement of second has 15 states. [2018-11-10 13:21:45,197 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 [2018-11-10 13:21:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 13:21:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-10 13:21:45,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 22 letters. Loop has 17 letters. [2018-11-10 13:21:45,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:45,197 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 13:21:45,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:45,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:45,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:45,274 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 [2018-11-10 13:21:45,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 564 states and 630 transitions. cyclomatic complexity: 77 Second operand 7 states. [2018-11-10 13:21:45,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 564 states and 630 transitions. cyclomatic complexity: 77. Second operand 7 states. Result 896 states and 978 transitions. Complement of second has 17 states. [2018-11-10 13:21:45,362 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 [2018-11-10 13:21:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 13:21:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2018-11-10 13:21:45,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 54 transitions. Stem has 22 letters. Loop has 17 letters. [2018-11-10 13:21:45,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:45,363 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 13:21:45,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:45,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:45,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:45,461 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 [2018-11-10 13:21:45,461 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 564 states and 630 transitions. cyclomatic complexity: 77 Second operand 7 states. [2018-11-10 13:21:45,601 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 564 states and 630 transitions. cyclomatic complexity: 77. Second operand 7 states. Result 1335 states and 1465 transitions. Complement of second has 14 states. [2018-11-10 13:21:45,602 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 [2018-11-10 13:21:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 13:21:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-11-10 13:21:45,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 22 letters. Loop has 17 letters. [2018-11-10 13:21:45,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:45,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 39 letters. Loop has 17 letters. [2018-11-10 13:21:45,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:45,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 22 letters. Loop has 34 letters. [2018-11-10 13:21:45,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:21:45,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1335 states and 1465 transitions. [2018-11-10 13:21:45,609 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:21:45,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1335 states to 0 states and 0 transitions. [2018-11-10 13:21:45,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:21:45,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:21:45,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:21:45,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:21:45,609 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:21:45,609 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:21:45,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:21:45,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:21:45,610 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 7 states. [2018-11-10 13:21:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:45,610 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 13:21:45,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:21:45,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 13:21:45,610 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:21:45,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:21:45,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:21:45,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:21:45,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:21:45,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:21:45,611 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:21:45,611 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:21:45,611 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:21:45,611 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 13:21:45,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:21:45,611 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:21:45,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 13:21:45,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:21:45 BoogieIcfgContainer [2018-11-10 13:21:45,617 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:21:45,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:21:45,617 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:21:45,617 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:21:45,617 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:21:38" (3/4) ... [2018-11-10 13:21:45,620 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:21:45,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:21:45,621 INFO L168 Benchmark]: Toolchain (without parser) took 7153.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.2 MB). Free memory was 959.1 MB in the beginning and 926.8 MB in the end (delta: 32.3 MB). Peak memory consumption was 339.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:21:45,622 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:21:45,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.12 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:21:45,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.06 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:21:45,623 INFO L168 Benchmark]: Boogie Preprocessor took 13.98 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:21:45,623 INFO L168 Benchmark]: RCFGBuilder took 292.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:21:45,624 INFO L168 Benchmark]: BuchiAutomizer took 6679.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 926.8 MB in the end (delta: 206.2 MB). Peak memory consumption was 356.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:21:45,624 INFO L168 Benchmark]: Witness Printer took 3.59 ms. Allocated memory is still 1.3 GB. Free memory is still 926.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:21:45,626 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 136.12 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.06 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.98 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 292.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6679.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 926.8 MB in the end (delta: 206.2 MB). Peak memory consumption was 356.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.59 ms. Allocated memory is still 1.3 GB. Free memory is still 926.8 MB. 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 (7 trivial, 6 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 4 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function 3 * r + -2 * j and consists of 7 locations. One deterministic module has affine ranking function -2 * j + 3 * n and consists of 8 locations. One nondeterministic module has affine ranking function 3 * n + -2 * j and consists of 8 locations. 7 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 3.7s. Construction of modules took 1.5s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 594 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 564 states and ocurred in iteration 8. Nontrivial modules had stage [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 773 SDtfs, 1298 SDslu, 755 SDs, 0 SdLazy, 911 SolverSat, 203 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT5 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital36 mio100 ax100 hnf96 lsp76 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp96 dnf100 smp100 tf105 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 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...