./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-635dfa2 [2018-12-02 15:43:18,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:43:18,131 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:43:18,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:43:18,137 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:43:18,137 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:43:18,138 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:43:18,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:43:18,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:43:18,140 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:43:18,140 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:43:18,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:43:18,141 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:43:18,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:43:18,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:43:18,142 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:43:18,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:43:18,143 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:43:18,144 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:43:18,145 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:43:18,145 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:43:18,146 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:43:18,147 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:43:18,147 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:43:18,147 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:43:18,148 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:43:18,148 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:43:18,149 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:43:18,149 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:43:18,150 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:43:18,150 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:43:18,150 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:43:18,150 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:43:18,150 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:43:18,151 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:43:18,151 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:43:18,151 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 15:43:18,159 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:43:18,159 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:43:18,160 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:43:18,160 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:43:18,160 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 15:43:18,160 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 15:43:18,160 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 15:43:18,160 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 15:43:18,160 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 15:43:18,160 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 15:43:18,160 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 15:43:18,161 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:43:18,161 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:43:18,161 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 15:43:18,161 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:43:18,161 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:43:18,161 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:43:18,161 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 15:43:18,161 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 15:43:18,161 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 15:43:18,161 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:43:18,161 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:43:18,162 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 15:43:18,162 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 15:43:18,162 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 15:43:18,162 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:43:18,162 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:43:18,162 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 15:43:18,162 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:43:18,162 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 15:43:18,162 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 15:43:18,163 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 15:43:18,163 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_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:18,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:43:18,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:43:18,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:43:18,189 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:43:18,189 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:43:18,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-12-02 15:43:18,225 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/data/277a35509/cb1c85eda97648aaafa23aa4ef4e2fcb/FLAG2315494f3 [2018-12-02 15:43:18,637 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:43:18,638 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-12-02 15:43:18,641 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/data/277a35509/cb1c85eda97648aaafa23aa4ef4e2fcb/FLAG2315494f3 [2018-12-02 15:43:18,650 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/data/277a35509/cb1c85eda97648aaafa23aa4ef4e2fcb [2018-12-02 15:43:18,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:43:18,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:43:18,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:43:18,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:43:18,656 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:43:18,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:43:18" (1/1) ... [2018-12-02 15:43:18,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3163dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18, skipping insertion in model container [2018-12-02 15:43:18,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:43:18" (1/1) ... [2018-12-02 15:43:18,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:43:18,679 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:43:18,769 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:43:18,772 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:43:18,784 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:43:18,792 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:43:18,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18 WrapperNode [2018-12-02 15:43:18,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:43:18,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:43:18,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:43:18,793 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:43:18,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18" (1/1) ... [2018-12-02 15:43:18,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18" (1/1) ... [2018-12-02 15:43:18,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:43:18,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:43:18,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:43:18,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:43:18,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18" (1/1) ... [2018-12-02 15:43:18,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18" (1/1) ... [2018-12-02 15:43:18,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18" (1/1) ... [2018-12-02 15:43:18,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18" (1/1) ... [2018-12-02 15:43:18,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18" (1/1) ... [2018-12-02 15:43:18,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18" (1/1) ... [2018-12-02 15:43:18,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18" (1/1) ... [2018-12-02 15:43:18,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:43:18,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:43:18,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:43:18,829 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:43:18,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:18,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:43:18,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:43:19,034 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:43:19,034 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2018-12-02 15:43:19,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:43:19 BoogieIcfgContainer [2018-12-02 15:43:19,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:43:19,035 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 15:43:19,035 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 15:43:19,037 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 15:43:19,038 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:43:19,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 03:43:18" (1/3) ... [2018-12-02 15:43:19,038 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46c44c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:43:19, skipping insertion in model container [2018-12-02 15:43:19,038 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:43:19,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:18" (2/3) ... [2018-12-02 15:43:19,039 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46c44c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:43:19, skipping insertion in model container [2018-12-02 15:43:19,039 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:43:19,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:43:19" (3/3) ... [2018-12-02 15:43:19,040 INFO L375 chiAutomizerObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-12-02 15:43:19,070 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 15:43:19,071 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 15:43:19,071 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 15:43:19,071 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 15:43:19,071 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:43:19,071 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:43:19,071 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 15:43:19,071 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:43:19,071 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 15:43:19,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2018-12-02 15:43:19,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-12-02 15:43:19,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:19,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:19,100 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 15:43:19,100 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:19,100 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 15:43:19,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2018-12-02 15:43:19,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-12-02 15:43:19,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:19,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:19,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 15:43:19,103 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:19,107 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 55#L13true assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 31#L16true assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 40#L45-1true [2018-12-02 15:43:19,107 INFO L796 eck$LassoCheckResult]: Loop: 40#L45-1true assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 53#L24-2true assume !true; 52#L24-3true assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 32#L4-30true assume !(0 == __VERIFIER_assert_~cond); 44#L4-32true __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 42#L4-33true assume !(0 == __VERIFIER_assert_~cond); 39#L4-35true main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 40#L45-1true [2018-12-02 15:43:19,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:19,111 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2018-12-02 15:43:19,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:19,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:19,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115875, now seen corresponding path program 1 times [2018-12-02 15:43:19,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:19,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:19,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:19,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:43:19,198 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:43:19,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 15:43:19,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 15:43:19,208 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-12-02 15:43:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:19,214 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-12-02 15:43:19,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 15:43:19,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2018-12-02 15:43:19,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-12-02 15:43:19,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 42 transitions. [2018-12-02 15:43:19,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-02 15:43:19,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-02 15:43:19,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-12-02 15:43:19,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:43:19,220 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-02 15:43:19,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-12-02 15:43:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-02 15:43:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 15:43:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-12-02 15:43:19,238 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-02 15:43:19,238 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-02 15:43:19,238 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 15:43:19,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-12-02 15:43:19,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-12-02 15:43:19,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:19,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:19,239 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 15:43:19,239 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:19,239 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 116#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 117#L45-1 [2018-12-02 15:43:19,239 INFO L796 eck$LassoCheckResult]: Loop: 117#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 124#L24-2 assume !(main_~j~0 <= main_~r~0); 144#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 129#L4-36 assume !(0 == __VERIFIER_assert_~cond); 130#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 143#L4-39 assume !(0 == __VERIFIER_assert_~cond); 141#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 117#L45-1 [2018-12-02 15:43:19,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:19,239 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 2 times [2018-12-02 15:43:19,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:19,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:19,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:19,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:19,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:19,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1043651989, now seen corresponding path program 1 times [2018-12-02 15:43:19,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:19,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:19,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:19,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:19,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:19,280 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:43:19,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:43:19,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:43:19,280 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-02 15:43:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:19,350 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-12-02 15:43:19,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:43:19,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2018-12-02 15:43:19,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-12-02 15:43:19,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 80 transitions. [2018-12-02 15:43:19,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-12-02 15:43:19,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-12-02 15:43:19,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 80 transitions. [2018-12-02 15:43:19,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:43:19,353 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-12-02 15:43:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 80 transitions. [2018-12-02 15:43:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2018-12-02 15:43:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 15:43:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-02 15:43:19,355 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-02 15:43:19,355 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-02 15:43:19,355 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 15:43:19,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2018-12-02 15:43:19,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-12-02 15:43:19,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:19,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:19,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 15:43:19,356 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:19,356 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 264#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 230#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 231#L45-1 [2018-12-02 15:43:19,356 INFO L796 eck$LassoCheckResult]: Loop: 231#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 247#L24-2 assume !(main_~j~0 <= main_~r~0); 262#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 234#L4-30 assume !(0 == __VERIFIER_assert_~cond); 235#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 250#L4-33 assume !(0 == __VERIFIER_assert_~cond); 246#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 231#L45-1 [2018-12-02 15:43:19,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:19,356 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 3 times [2018-12-02 15:43:19,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:19,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:19,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:19,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:19,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:19,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 1 times [2018-12-02 15:43:19,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:19,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:19,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:19,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:19,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:19,374 INFO L82 PathProgramCache]: Analyzing trace with hash -769702287, now seen corresponding path program 1 times [2018-12-02 15:43:19,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:19,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:19,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:19,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:19,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:19,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:19,484 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:19,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:19,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:19,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:19,485 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:43:19,485 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:19,485 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:19,485 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:19,485 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2018-12-02 15:43:19,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:19,486 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:19,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:19,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:19,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:19,557 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:19,557 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:19,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:19,560 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:19,578 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:43:19,578 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:19,779 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:43:19,780 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:19,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:19,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:19,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:19,781 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:43:19,781 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:19,781 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:19,781 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:19,781 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2018-12-02 15:43:19,781 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:19,781 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:19,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:19,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:19,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:19,824 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:19,828 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:43:19,830 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-12-02 15:43:19,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:19,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:19,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:19,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:19,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:19,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:19,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:19,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:19,836 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-12-02 15:43:19,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:19,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:19,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:19,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:19,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:19,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:19,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:19,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:19,841 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-12-02 15:43:19,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:19,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:19,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:19,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:19,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:19,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:19,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:19,847 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:43:19,854 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:43:19,854 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 15:43:19,855 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:43:19,855 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:43:19,856 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:43:19,856 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2018-12-02 15:43:19,857 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:43:19,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:19,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:19,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:19,898 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-12-02 15:43:19,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-02 15:43:19,928 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 111 states and 132 transitions. Complement of second has 6 states. [2018-12-02 15:43:19,928 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-12-02 15:43:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 15:43:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-12-02 15:43:19,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 7 letters. [2018-12-02 15:43:19,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:19,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 10 letters. Loop has 7 letters. [2018-12-02 15:43:19,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:19,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 14 letters. [2018-12-02 15:43:19,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:19,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2018-12-02 15:43:19,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-12-02 15:43:19,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 106 states and 125 transitions. [2018-12-02 15:43:19,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-12-02 15:43:19,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-12-02 15:43:19,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 125 transitions. [2018-12-02 15:43:19,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:19,934 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2018-12-02 15:43:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 125 transitions. [2018-12-02 15:43:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-12-02 15:43:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 15:43:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2018-12-02 15:43:19,937 INFO L728 BuchiCegarLoop]: Abstraction has 105 states and 124 transitions. [2018-12-02 15:43:19,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:43:19,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:43:19,937 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 3 states. [2018-12-02 15:43:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:19,949 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2018-12-02 15:43:19,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:43:19,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 147 transitions. [2018-12-02 15:43:19,951 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2018-12-02 15:43:19,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 110 transitions. [2018-12-02 15:43:19,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2018-12-02 15:43:19,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2018-12-02 15:43:19,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 110 transitions. [2018-12-02 15:43:19,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:43:19,952 INFO L705 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-12-02 15:43:19,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 110 transitions. [2018-12-02 15:43:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2018-12-02 15:43:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-02 15:43:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-12-02 15:43:19,954 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-12-02 15:43:19,954 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-12-02 15:43:19,954 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 15:43:19,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2018-12-02 15:43:19,955 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-12-02 15:43:19,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:19,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:19,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 15:43:19,955 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:19,956 INFO L794 eck$LassoCheckResult]: Stem: 698#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 699#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 665#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 666#L45-1 [2018-12-02 15:43:19,956 INFO L796 eck$LassoCheckResult]: Loop: 666#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 705#L24-2 assume !(main_~j~0 <= main_~r~0); 703#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 670#L4-30 assume !(0 == __VERIFIER_assert_~cond); 671#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 686#L4-33 assume !(0 == __VERIFIER_assert_~cond); 682#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 666#L45-1 [2018-12-02 15:43:19,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash 30947, now seen corresponding path program 1 times [2018-12-02 15:43:19,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:19,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:19,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:19,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 2 times [2018-12-02 15:43:19,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:19,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:19,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:19,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:19,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:19,969 INFO L82 PathProgramCache]: Analyzing trace with hash 39644339, now seen corresponding path program 1 times [2018-12-02 15:43:19,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:19,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:19,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:19,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:19,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:19,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:43:20,059 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:20,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:20,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:20,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:20,060 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:43:20,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:20,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:20,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:20,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration4_Loop [2018-12-02 15:43:20,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:20,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:20,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,106 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:20,107 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:20,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:20,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:20,111 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:20,111 INFO L448 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_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:20,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:20,126 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:20,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:43:20,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:20,319 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:43:20,321 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:20,321 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:20,321 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:20,321 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:20,321 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:43:20,321 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:20,321 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:20,321 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:20,321 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration4_Loop [2018-12-02 15:43:20,321 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:20,321 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:20,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,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-12-02 15:43:20,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,387 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:20,388 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:43:20,388 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-12-02 15:43:20,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:20,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:20,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:20,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:20,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:20,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:20,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:20,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:20,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-12-02 15:43:20,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:20,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:20,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:20,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:20,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:20,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:20,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:20,396 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:43:20,399 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:43:20,399 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 15:43:20,399 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:43:20,399 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:43:20,399 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:43:20,399 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2018-12-02 15:43:20,400 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:43:20,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:20,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:20,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:20,434 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-12-02 15:43:20,434 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-12-02 15:43:20,448 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 155 states and 181 transitions. Complement of second has 6 states. [2018-12-02 15:43:20,449 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-12-02 15:43:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 15:43:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-12-02 15:43:20,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 7 letters. [2018-12-02 15:43:20,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:20,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 10 letters. Loop has 7 letters. [2018-12-02 15:43:20,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:20,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 14 letters. [2018-12-02 15:43:20,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:20,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 181 transitions. [2018-12-02 15:43:20,452 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2018-12-02 15:43:20,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 120 states and 140 transitions. [2018-12-02 15:43:20,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-12-02 15:43:20,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2018-12-02 15:43:20,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 140 transitions. [2018-12-02 15:43:20,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:20,454 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-12-02 15:43:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 140 transitions. [2018-12-02 15:43:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 63. [2018-12-02 15:43:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 15:43:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-12-02 15:43:20,456 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-12-02 15:43:20,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:43:20,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:43:20,456 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2018-12-02 15:43:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:20,530 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2018-12-02 15:43:20,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:43:20,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 220 transitions. [2018-12-02 15:43:20,531 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2018-12-02 15:43:20,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 220 transitions. [2018-12-02 15:43:20,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2018-12-02 15:43:20,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2018-12-02 15:43:20,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2018-12-02 15:43:20,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:20,533 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2018-12-02 15:43:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2018-12-02 15:43:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 64. [2018-12-02 15:43:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-02 15:43:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-12-02 15:43:20,536 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-12-02 15:43:20,536 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-12-02 15:43:20,536 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 15:43:20,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2018-12-02 15:43:20,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-12-02 15:43:20,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:20,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:20,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 15:43:20,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:20,537 INFO L794 eck$LassoCheckResult]: Stem: 1259#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1260#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1203#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 1205#L45-1 [2018-12-02 15:43:20,537 INFO L796 eck$LassoCheckResult]: Loop: 1205#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1232#L24-2 assume !!(main_~j~0 <= main_~r~0); 1239#L25 assume !(main_~j~0 < main_~r~0); 1236#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1234#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1228#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1222#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1223#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1253#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1226#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1227#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1252#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1249#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1205#L45-1 [2018-12-02 15:43:20,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:20,537 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 4 times [2018-12-02 15:43:20,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:20,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:20,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:20,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:20,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:20,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:20,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2136697343, now seen corresponding path program 1 times [2018-12-02 15:43:20,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:20,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:20,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:20,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:20,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:20,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:20,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737125, now seen corresponding path program 1 times [2018-12-02 15:43:20,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:20,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:20,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:20,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:20,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:20,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:20,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:43:20,689 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:20,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:20,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:20,690 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:20,690 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:43:20,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:20,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:20,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:20,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2018-12-02 15:43:20,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:20,690 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:20,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,750 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:20,751 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:20,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:20,752 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:20,768 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:43:20,768 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:20,788 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:43:20,789 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:20,789 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:20,789 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:20,789 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:20,789 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:43:20,789 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:20,789 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:20,789 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:20,790 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2018-12-02 15:43:20,790 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:20,790 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:20,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:20,865 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:20,865 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:43:20,865 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-12-02 15:43:20,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:20,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:20,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:20,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:20,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:20,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:20,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:20,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:43:20,870 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:43:20,870 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 15:43:20,870 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:43:20,870 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:43:20,871 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:43:20,871 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2018-12-02 15:43:20,871 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:43:20,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:20,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:20,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:20,895 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-12-02 15:43:20,895 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-02 15:43:20,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 124 states and 144 transitions. Complement of second has 4 states. [2018-12-02 15:43:20,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 15:43:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 15:43:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-12-02 15:43:20,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 13 letters. [2018-12-02 15:43:20,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:20,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2018-12-02 15:43:20,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:20,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 26 letters. [2018-12-02 15:43:20,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:20,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2018-12-02 15:43:20,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-12-02 15:43:20,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 138 transitions. [2018-12-02 15:43:20,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-12-02 15:43:20,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2018-12-02 15:43:20,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 138 transitions. [2018-12-02 15:43:20,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:20,912 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2018-12-02 15:43:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 138 transitions. [2018-12-02 15:43:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-12-02 15:43:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-02 15:43:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2018-12-02 15:43:20,915 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2018-12-02 15:43:20,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:43:20,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:43:20,915 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 5 states. [2018-12-02 15:43:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:20,940 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-12-02 15:43:20,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:43:20,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 77 transitions. [2018-12-02 15:43:20,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-12-02 15:43:20,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 64 states and 74 transitions. [2018-12-02 15:43:20,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-12-02 15:43:20,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-12-02 15:43:20,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2018-12-02 15:43:20,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:20,941 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-12-02 15:43:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2018-12-02 15:43:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-02 15:43:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-02 15:43:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-12-02 15:43:20,944 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-12-02 15:43:20,944 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-12-02 15:43:20,944 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 15:43:20,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 74 transitions. [2018-12-02 15:43:20,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-12-02 15:43:20,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:20,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:20,945 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 15:43:20,945 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:20,946 INFO L794 eck$LassoCheckResult]: Stem: 1705#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1706#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1649#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 1650#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1678#L24-2 [2018-12-02 15:43:20,946 INFO L796 eck$LassoCheckResult]: Loop: 1678#L24-2 assume !!(main_~j~0 <= main_~r~0); 1685#L25 assume !(main_~j~0 < main_~r~0); 1680#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1681#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1673#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1667#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1668#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1699#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1671#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1672#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1698#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1695#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1677#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1678#L24-2 [2018-12-02 15:43:20,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:20,946 INFO L82 PathProgramCache]: Analyzing trace with hash 959377, now seen corresponding path program 1 times [2018-12-02 15:43:20,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:20,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:20,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:20,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:20,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:20,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1321235687, now seen corresponding path program 2 times [2018-12-02 15:43:20,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:20,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:20,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:20,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:20,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:20,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:20,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1718346921, now seen corresponding path program 1 times [2018-12-02 15:43:20,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:20,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:20,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:20,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:20,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:20,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:20,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:43:21,115 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:21,116 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:21,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:21,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:21,116 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:43:21,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:21,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:21,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:21,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2018-12-02 15:43:21,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:21,116 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:21,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:21,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:21,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:21,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:21,166 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:21,166 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:21,169 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:21,169 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:21,172 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:21,172 INFO L448 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_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:21,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:21,196 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:21,198 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:21,198 INFO L448 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_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:21,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:21,213 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:21,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:43:21,238 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:21,467 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:43:21,470 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:21,470 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:21,470 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:21,470 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:21,470 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:43:21,470 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:21,470 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:21,471 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:21,471 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2018-12-02 15:43:21,471 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:21,471 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:21,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:21,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:21,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:21,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:21,520 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:21,521 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:43:21,521 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-12-02 15:43:21,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:21,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:21,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:21,521 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 15:43:21,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:21,522 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 15:43:21,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:21,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:21,523 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-12-02 15:43:21,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:21,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:21,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:21,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:21,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:21,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:21,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:21,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:21,525 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-12-02 15:43:21,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:21,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:21,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:21,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:21,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:21,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:21,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:21,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:21,527 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-12-02 15:43:21,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:21,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:21,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:21,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:21,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:21,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:21,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:21,530 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:43:21,532 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:43:21,533 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 15:43:21,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:43:21,533 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:43:21,533 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:43:21,533 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2018-12-02 15:43:21,534 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:43:21,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:21,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:21,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:21,570 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-12-02 15:43:21,570 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-02 15:43:21,589 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 128 states and 150 transitions. Complement of second has 6 states. [2018-12-02 15:43:21,590 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-12-02 15:43:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 15:43:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-12-02 15:43:21,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 13 letters. [2018-12-02 15:43:21,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:21,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 17 letters. Loop has 13 letters. [2018-12-02 15:43:21,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:21,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 26 letters. [2018-12-02 15:43:21,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:21,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 150 transitions. [2018-12-02 15:43:21,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 15:43:21,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 122 states and 143 transitions. [2018-12-02 15:43:21,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-02 15:43:21,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-12-02 15:43:21,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 143 transitions. [2018-12-02 15:43:21,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:21,592 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 143 transitions. [2018-12-02 15:43:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 143 transitions. [2018-12-02 15:43:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-12-02 15:43:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-02 15:43:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-12-02 15:43:21,594 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-12-02 15:43:21,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:43:21,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:43:21,595 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 6 states. [2018-12-02 15:43:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:21,675 INFO L93 Difference]: Finished difference Result 401 states and 447 transitions. [2018-12-02 15:43:21,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 15:43:21,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 447 transitions. [2018-12-02 15:43:21,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2018-12-02 15:43:21,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 353 states and 395 transitions. [2018-12-02 15:43:21,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-12-02 15:43:21,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-12-02 15:43:21,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 395 transitions. [2018-12-02 15:43:21,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:21,678 INFO L705 BuchiCegarLoop]: Abstraction has 353 states and 395 transitions. [2018-12-02 15:43:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 395 transitions. [2018-12-02 15:43:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 121. [2018-12-02 15:43:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 15:43:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2018-12-02 15:43:21,681 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2018-12-02 15:43:21,681 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2018-12-02 15:43:21,681 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 15:43:21,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 141 transitions. [2018-12-02 15:43:21,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 15:43:21,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:21,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:21,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 15:43:21,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:21,682 INFO L794 eck$LassoCheckResult]: Stem: 2509#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 2510#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2450#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2451#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2480#L24-2 assume !!(main_~j~0 <= main_~r~0); 2488#L25 [2018-12-02 15:43:21,682 INFO L796 eck$LassoCheckResult]: Loop: 2488#L25 assume !(main_~j~0 < main_~r~0); 2483#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2484#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2475#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2469#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2470#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2500#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2496#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2492#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2493#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2514#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2507#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2467#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2461#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2462#L24-2 assume !!(main_~j~0 <= main_~r~0); 2488#L25 [2018-12-02 15:43:21,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:21,682 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 1 times [2018-12-02 15:43:21,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:21,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:21,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:21,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:21,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:21,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1728992636, now seen corresponding path program 1 times [2018-12-02 15:43:21,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:21,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:21,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:21,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:21,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:43:21,711 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:43:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:43:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:43:21,711 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. cyclomatic complexity: 24 Second operand 6 states. [2018-12-02 15:43:21,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:21,782 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2018-12-02 15:43:21,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:43:21,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 238 transitions. [2018-12-02 15:43:21,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 15:43:21,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 198 states and 224 transitions. [2018-12-02 15:43:21,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-02 15:43:21,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-02 15:43:21,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 224 transitions. [2018-12-02 15:43:21,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:21,784 INFO L705 BuchiCegarLoop]: Abstraction has 198 states and 224 transitions. [2018-12-02 15:43:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 224 transitions. [2018-12-02 15:43:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 163. [2018-12-02 15:43:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-02 15:43:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2018-12-02 15:43:21,787 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2018-12-02 15:43:21,787 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2018-12-02 15:43:21,787 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 15:43:21,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 185 transitions. [2018-12-02 15:43:21,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 15:43:21,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:21,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:21,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 15:43:21,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:21,789 INFO L794 eck$LassoCheckResult]: Stem: 2862#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 2863#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2800#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2801#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2830#L24-2 assume !!(main_~j~0 <= main_~r~0); 2838#L25 [2018-12-02 15:43:21,789 INFO L796 eck$LassoCheckResult]: Loop: 2838#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2839#L4 assume !(0 == __VERIFIER_assert_~cond); 2871#L4-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2867#L4-3 assume !(0 == __VERIFIER_assert_~cond); 2857#L4-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2814#L4-6 assume !(0 == __VERIFIER_assert_~cond); 2808#L4-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2802#L4-9 assume !(0 == __VERIFIER_assert_~cond); 2803#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 2833#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2834#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2826#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2820#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2821#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2852#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2848#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2844#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2845#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2869#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2860#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2817#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2810#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2811#L24-2 assume !!(main_~j~0 <= main_~r~0); 2838#L25 [2018-12-02 15:43:21,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 2 times [2018-12-02 15:43:21,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:21,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:21,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2022918237, now seen corresponding path program 1 times [2018-12-02 15:43:21,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:21,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:21,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:21,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:21,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:21,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:21,809 INFO L82 PathProgramCache]: Analyzing trace with hash -301361000, now seen corresponding path program 1 times [2018-12-02 15:43:21,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:21,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:21,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:21,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:21,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:43:21,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:43:21,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:21,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:22,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:43:22,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2018-12-02 15:43:22,113 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-12-02 15:43:22,541 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2018-12-02 15:43:22,542 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:22,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:22,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:22,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:22,542 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:43:22,542 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:22,542 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:22,542 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:22,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2018-12-02 15:43:22,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:22,542 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:22,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:22,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:22,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:22,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:22,590 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:22,590 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:22,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:22,592 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:22,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:43:22,610 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:22,698 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:43:22,699 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:22,700 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:22,700 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:22,700 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:22,700 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:43:22,700 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:22,700 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:22,700 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:22,700 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2018-12-02 15:43:22,700 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:22,700 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:22,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:22,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:22,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:22,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:22,755 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:22,755 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:43:22,756 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-12-02 15:43:22,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:22,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:22,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:22,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:22,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:22,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:22,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:22,760 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:43:22,763 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 15:43:22,763 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 15:43:22,763 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:43:22,763 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:43:22,763 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:43:22,763 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0, ULTIMATE.start_main_~j~0) = 5*ULTIMATE.start_main_~r~0 - 8*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-12-02 15:43:22,764 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:43:22,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:22,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:22,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:22,834 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-12-02 15:43:22,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-12-02 15:43:23,247 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 891 states and 985 transitions. Complement of second has 15 states. [2018-12-02 15:43:23,247 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-12-02 15:43:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 15:43:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-12-02 15:43:23,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 5 letters. Loop has 23 letters. [2018-12-02 15:43:23,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:23,249 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 15:43:23,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:23,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:23,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:23,308 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-12-02 15:43:23,308 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-12-02 15:43:23,769 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 891 states and 985 transitions. Complement of second has 15 states. [2018-12-02 15:43:23,769 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-12-02 15:43:23,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 15:43:23,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-12-02 15:43:23,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 5 letters. Loop has 23 letters. [2018-12-02 15:43:23,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:23,770 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 15:43:23,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:23,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:23,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:23,841 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-12-02 15:43:23,841 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-12-02 15:43:24,530 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 1542 states and 1650 transitions. Complement of second has 64 states. [2018-12-02 15:43:24,531 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-12-02 15:43:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 15:43:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2018-12-02 15:43:24,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 146 transitions. Stem has 5 letters. Loop has 23 letters. [2018-12-02 15:43:24,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:24,532 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 15:43:24,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:24,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:24,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:24,599 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-02 15:43:24,599 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-12-02 15:43:24,817 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 793 states and 849 transitions. Complement of second has 29 states. [2018-12-02 15:43:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-12-02 15:43:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 15:43:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2018-12-02 15:43:24,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 145 transitions. Stem has 5 letters. Loop has 23 letters. [2018-12-02 15:43:24,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:24,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 145 transitions. Stem has 28 letters. Loop has 23 letters. [2018-12-02 15:43:24,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:24,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 145 transitions. Stem has 5 letters. Loop has 46 letters. [2018-12-02 15:43:24,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:24,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 793 states and 849 transitions. [2018-12-02 15:43:24,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 15:43:24,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 793 states to 531 states and 581 transitions. [2018-12-02 15:43:24,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-12-02 15:43:24,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-02 15:43:24,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 531 states and 581 transitions. [2018-12-02 15:43:24,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:24,828 INFO L705 BuchiCegarLoop]: Abstraction has 531 states and 581 transitions. [2018-12-02 15:43:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states and 581 transitions. [2018-12-02 15:43:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 315. [2018-12-02 15:43:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-02 15:43:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 349 transitions. [2018-12-02 15:43:24,833 INFO L728 BuchiCegarLoop]: Abstraction has 315 states and 349 transitions. [2018-12-02 15:43:24,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 15:43:24,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-02 15:43:24,834 INFO L87 Difference]: Start difference. First operand 315 states and 349 transitions. Second operand 12 states. [2018-12-02 15:43:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:25,215 INFO L93 Difference]: Finished difference Result 684 states and 740 transitions. [2018-12-02 15:43:25,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:43:25,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 684 states and 740 transitions. [2018-12-02 15:43:25,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 15:43:25,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 684 states to 454 states and 504 transitions. [2018-12-02 15:43:25,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-02 15:43:25,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-02 15:43:25,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 454 states and 504 transitions. [2018-12-02 15:43:25,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:25,220 INFO L705 BuchiCegarLoop]: Abstraction has 454 states and 504 transitions. [2018-12-02 15:43:25,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states and 504 transitions. [2018-12-02 15:43:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 362. [2018-12-02 15:43:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-02 15:43:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 402 transitions. [2018-12-02 15:43:25,224 INFO L728 BuchiCegarLoop]: Abstraction has 362 states and 402 transitions. [2018-12-02 15:43:25,224 INFO L608 BuchiCegarLoop]: Abstraction has 362 states and 402 transitions. [2018-12-02 15:43:25,224 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 15:43:25,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 362 states and 402 transitions. [2018-12-02 15:43:25,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 15:43:25,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:25,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:25,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:25,226 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:25,226 INFO L794 eck$LassoCheckResult]: Stem: 8759#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 8760#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 8697#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 8698#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 8727#L24-2 assume !!(main_~j~0 <= main_~r~0); 8941#L25 assume !(main_~j~0 < main_~r~0); 8906#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8904#L4-12 assume !(0 == __VERIFIER_assert_~cond); 8902#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8900#L4-15 assume !(0 == __VERIFIER_assert_~cond); 8897#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 8896#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8895#L4-30 assume !(0 == __VERIFIER_assert_~cond); 8894#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8893#L4-33 assume !(0 == __VERIFIER_assert_~cond); 8892#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 8807#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 8804#L24-2 assume !!(main_~j~0 <= main_~r~0); 8802#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8736#L4 [2018-12-02 15:43:25,226 INFO L796 eck$LassoCheckResult]: Loop: 8736#L4 assume !(0 == __VERIFIER_assert_~cond); 8768#L4-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8763#L4-3 assume !(0 == __VERIFIER_assert_~cond); 8753#L4-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8712#L4-6 assume !(0 == __VERIFIER_assert_~cond); 8705#L4-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8699#L4-9 assume !(0 == __VERIFIER_assert_~cond); 8700#L4-11 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4; 8730#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8731#L4-12 assume !(0 == __VERIFIER_assert_~cond); 8723#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8717#L4-15 assume !(0 == __VERIFIER_assert_~cond); 8718#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8748#L4-18 assume !(0 == __VERIFIER_assert_~cond); 8744#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8740#L4-21 assume !(0 == __VERIFIER_assert_~cond); 8741#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8766#L4-24 assume !(0 == __VERIFIER_assert_~cond); 8756#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8715#L4-27 assume !(0 == __VERIFIER_assert_~cond); 8708#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 8709#L24-2 assume !!(main_~j~0 <= main_~r~0); 8735#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8736#L4 [2018-12-02 15:43:25,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:25,227 INFO L82 PathProgramCache]: Analyzing trace with hash -452128880, now seen corresponding path program 1 times [2018-12-02 15:43:25,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:25,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:25,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:25,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:25,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:25,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:25,236 INFO L82 PathProgramCache]: Analyzing trace with hash 552427161, now seen corresponding path program 1 times [2018-12-02 15:43:25,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:25,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:25,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:25,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:25,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:25,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:25,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1182908886, now seen corresponding path program 1 times [2018-12-02 15:43:25,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:25,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:25,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:25,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:43:25,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:43:25,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:25,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:25,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:43:25,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-12-02 15:43:25,570 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2018-12-02 15:43:25,571 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-12-02 15:43:25,846 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:25,846 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:25,846 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:25,846 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:25,847 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:43:25,847 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:25,847 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:25,847 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:25,847 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2018-12-02 15:43:25,847 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:25,847 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:25,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:25,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:25,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-12-02 15:43:25,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-12-02 15:43:25,902 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:25,902 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:25,904 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:25,905 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:25,906 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:25,906 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:25,922 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:25,922 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:25,923 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:25,924 INFO L448 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_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:25,939 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:25,939 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:25,942 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:25,942 INFO L448 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_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:25,957 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:25,957 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:25,975 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:43:25,975 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:26,035 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:43:26,037 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:26,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:26,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:26,037 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:26,037 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:43:26,037 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:26,037 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:26,037 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:26,037 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2018-12-02 15:43:26,037 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:26,037 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:26,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:26,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:26,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:26,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:26,088 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:26,088 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:43:26,089 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-12-02 15:43:26,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:26,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:26,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:26,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:26,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:26,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:26,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:26,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:26,090 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-12-02 15:43:26,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:26,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:26,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:26,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:26,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:26,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:26,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:26,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:26,091 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-12-02 15:43:26,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:26,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:26,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:26,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:26,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:26,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:26,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:26,093 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:43:26,095 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:43:26,095 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:43:26,095 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:43:26,096 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:43:26,096 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:43:26,096 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~r~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-12-02 15:43:26,096 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:43:26,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:26,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:26,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:26,160 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-12-02 15:43:26,160 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 362 states and 402 transitions. cyclomatic complexity: 45 Second operand 7 states. [2018-12-02 15:43:26,294 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 362 states and 402 transitions. cyclomatic complexity: 45. Second operand 7 states. Result 1266 states and 1396 transitions. Complement of second has 15 states. [2018-12-02 15:43:26,294 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-12-02 15:43:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 15:43:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2018-12-02 15:43:26,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 85 transitions. Stem has 19 letters. Loop has 23 letters. [2018-12-02 15:43:26,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:26,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 85 transitions. Stem has 42 letters. Loop has 23 letters. [2018-12-02 15:43:26,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:26,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 85 transitions. Stem has 19 letters. Loop has 46 letters. [2018-12-02 15:43:26,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:26,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1266 states and 1396 transitions. [2018-12-02 15:43:26,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 15:43:26,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1266 states to 876 states and 964 transitions. [2018-12-02 15:43:26,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-12-02 15:43:26,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-12-02 15:43:26,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 876 states and 964 transitions. [2018-12-02 15:43:26,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:26,301 INFO L705 BuchiCegarLoop]: Abstraction has 876 states and 964 transitions. [2018-12-02 15:43:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states and 964 transitions. [2018-12-02 15:43:26,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 618. [2018-12-02 15:43:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-12-02 15:43:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 686 transitions. [2018-12-02 15:43:26,307 INFO L728 BuchiCegarLoop]: Abstraction has 618 states and 686 transitions. [2018-12-02 15:43:26,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 15:43:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-02 15:43:26,307 INFO L87 Difference]: Start difference. First operand 618 states and 686 transitions. Second operand 12 states. [2018-12-02 15:43:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:27,060 INFO L93 Difference]: Finished difference Result 1396 states and 1503 transitions. [2018-12-02 15:43:27,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 15:43:27,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1396 states and 1503 transitions. [2018-12-02 15:43:27,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 15:43:27,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1396 states to 1081 states and 1170 transitions. [2018-12-02 15:43:27,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-12-02 15:43:27,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-12-02 15:43:27,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1081 states and 1170 transitions. [2018-12-02 15:43:27,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:27,066 INFO L705 BuchiCegarLoop]: Abstraction has 1081 states and 1170 transitions. [2018-12-02 15:43:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states and 1170 transitions. [2018-12-02 15:43:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 528. [2018-12-02 15:43:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-12-02 15:43:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 588 transitions. [2018-12-02 15:43:27,071 INFO L728 BuchiCegarLoop]: Abstraction has 528 states and 588 transitions. [2018-12-02 15:43:27,071 INFO L608 BuchiCegarLoop]: Abstraction has 528 states and 588 transitions. [2018-12-02 15:43:27,071 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 15:43:27,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 528 states and 588 transitions. [2018-12-02 15:43:27,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 15:43:27,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:27,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:27,073 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:27,073 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:27,073 INFO L794 eck$LassoCheckResult]: Stem: 12728#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 12729#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 12667#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 12668#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 12697#L24-2 assume !!(main_~j~0 <= main_~r~0); 12907#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12908#L4 assume !(0 == __VERIFIER_assert_~cond); 12903#L4-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12904#L4-3 assume !(0 == __VERIFIER_assert_~cond); 12899#L4-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12900#L4-6 assume !(0 == __VERIFIER_assert_~cond); 12895#L4-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12896#L4-9 assume !(0 == __VERIFIER_assert_~cond); 12891#L4-11 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4; 12889#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12886#L4-12 assume !(0 == __VERIFIER_assert_~cond); 12883#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12880#L4-15 assume !(0 == __VERIFIER_assert_~cond); 12875#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 12872#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12870#L4-30 assume !(0 == __VERIFIER_assert_~cond); 12868#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12866#L4-33 assume !(0 == __VERIFIER_assert_~cond); 12864#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 12771#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 12769#L24-2 assume !!(main_~j~0 <= main_~r~0); 12766#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12706#L4 [2018-12-02 15:43:27,073 INFO L796 eck$LassoCheckResult]: Loop: 12706#L4 assume !(0 == __VERIFIER_assert_~cond); 12737#L4-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12732#L4-3 assume !(0 == __VERIFIER_assert_~cond); 12722#L4-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12682#L4-6 assume !(0 == __VERIFIER_assert_~cond); 12675#L4-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12669#L4-9 assume !(0 == __VERIFIER_assert_~cond); 12670#L4-11 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4; 12699#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12700#L4-12 assume !(0 == __VERIFIER_assert_~cond); 12693#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12687#L4-15 assume !(0 == __VERIFIER_assert_~cond); 12688#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12717#L4-18 assume !(0 == __VERIFIER_assert_~cond); 12712#L4-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12708#L4-21 assume !(0 == __VERIFIER_assert_~cond); 12709#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12735#L4-24 assume !(0 == __VERIFIER_assert_~cond); 12725#L4-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12685#L4-27 assume !(0 == __VERIFIER_assert_~cond); 12678#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 12679#L24-2 assume !!(main_~j~0 <= main_~r~0); 12705#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12706#L4 [2018-12-02 15:43:27,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1231332657, now seen corresponding path program 1 times [2018-12-02 15:43:27,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:27,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:27,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:27,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:27,081 INFO L82 PathProgramCache]: Analyzing trace with hash 552427161, now seen corresponding path program 2 times [2018-12-02 15:43:27,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:27,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:27,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:27,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:27,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:27,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:27,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2123514869, now seen corresponding path program 1 times [2018-12-02 15:43:27,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:27,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:27,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:27,191 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-12-02 15:43:27,415 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:27,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:27,415 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:27,415 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:27,415 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:43:27,415 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:27,415 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:27,415 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:27,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration10_Loop [2018-12-02 15:43:27,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:27,416 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:27,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:27,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:27,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:27,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:27,469 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:27,469 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:27,471 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:27,471 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:27,474 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:27,474 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:27,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:27,498 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:27,501 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:27,501 INFO L448 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_63902ba8-a855-415e-afdb-279cca31968d/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-12-02 15:43:27,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:27,516 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63902ba8-a855-415e-afdb-279cca31968d/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:27,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:43:27,534 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:27,588 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:43:27,589 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:27,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:27,590 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:27,590 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:27,590 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:43:27,590 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:27,590 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:27,590 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:27,590 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration10_Loop [2018-12-02 15:43:27,590 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:27,590 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:27,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:27,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:27,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:27,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:27,643 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:27,643 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:43:27,643 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-12-02 15:43:27,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:27,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:27,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:27,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:27,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:27,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:27,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:27,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:27,644 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-12-02 15:43:27,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:27,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:27,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:27,645 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 15:43:27,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:27,645 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 15:43:27,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:27,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:27,647 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-12-02 15:43:27,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:27,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:27,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:27,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:27,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:27,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:27,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:27,649 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:43:27,651 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:43:27,651 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:43:27,652 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:43:27,652 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:43:27,652 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:43:27,652 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~r~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-12-02 15:43:27,652 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:43:27,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:27,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:27,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:27,717 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-12-02 15:43:27,717 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 528 states and 588 transitions. cyclomatic complexity: 67 Second operand 7 states. [2018-12-02 15:43:27,795 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 528 states and 588 transitions. cyclomatic complexity: 67. Second operand 7 states. Result 748 states and 820 transitions. Complement of second has 15 states. [2018-12-02 15:43:27,795 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-12-02 15:43:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 15:43:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-12-02 15:43:27,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 27 letters. Loop has 23 letters. [2018-12-02 15:43:27,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:27,796 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 15:43:27,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:27,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:27,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:27,849 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-12-02 15:43:27,849 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 528 states and 588 transitions. cyclomatic complexity: 67 Second operand 7 states. [2018-12-02 15:43:27,965 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 528 states and 588 transitions. cyclomatic complexity: 67. Second operand 7 states. Result 826 states and 902 transitions. Complement of second has 19 states. [2018-12-02 15:43:27,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-12-02 15:43:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 15:43:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2018-12-02 15:43:27,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 82 transitions. Stem has 27 letters. Loop has 23 letters. [2018-12-02 15:43:27,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:27,965 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 15:43:27,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:27,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:27,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:28,016 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-12-02 15:43:28,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 528 states and 588 transitions. cyclomatic complexity: 67 Second operand 7 states. [2018-12-02 15:43:28,153 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 528 states and 588 transitions. cyclomatic complexity: 67. Second operand 7 states. Result 1236 states and 1355 transitions. Complement of second has 25 states. [2018-12-02 15:43:28,153 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-12-02 15:43:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 15:43:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2018-12-02 15:43:28,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 100 transitions. Stem has 27 letters. Loop has 23 letters. [2018-12-02 15:43:28,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:28,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 100 transitions. Stem has 50 letters. Loop has 23 letters. [2018-12-02 15:43:28,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:28,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 100 transitions. Stem has 27 letters. Loop has 46 letters. [2018-12-02 15:43:28,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:28,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1236 states and 1355 transitions. [2018-12-02 15:43:28,157 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 15:43:28,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1236 states to 0 states and 0 transitions. [2018-12-02 15:43:28,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 15:43:28,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 15:43:28,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 15:43:28,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:43:28,158 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:43:28,158 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:43:28,158 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:43:28,158 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 15:43:28,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 15:43:28,158 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 15:43:28,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 15:43:28,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 03:43:28 BoogieIcfgContainer [2018-12-02 15:43:28,162 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 15:43:28,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:43:28,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:43:28,162 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:43:28,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:43:19" (3/4) ... [2018-12-02 15:43:28,165 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 15:43:28,165 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:43:28,166 INFO L168 Benchmark]: Toolchain (without parser) took 9514.03 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 363.9 MB). Free memory was 962.4 MB in the beginning and 1.1 GB in the end (delta: -106.3 MB). Peak memory consumption was 257.6 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:28,166 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:43:28,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.65 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:28,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.43 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:28,167 INFO L168 Benchmark]: Boogie Preprocessor took 13.83 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:43:28,167 INFO L168 Benchmark]: RCFGBuilder took 205.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:28,167 INFO L168 Benchmark]: BuchiAutomizer took 9127.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.4 MB). Peak memory consumption was 267.5 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:28,168 INFO L168 Benchmark]: Witness Printer took 2.95 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:43:28,169 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.65 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.43 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.83 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 205.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9127.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.4 MB). Peak memory consumption was 267.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.95 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (9 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 3 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function r + -2 * j and consists of 8 locations. One nondeterministic module has affine ranking function 5 * r + -8 * j and consists of 10 locations. One nondeterministic module has affine ranking function r + -2 * j and consists of 8 locations. 9 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. Construction of modules took 2.7s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 1641 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 528 states and ocurred in iteration 9. Nontrivial modules had stage [5, 0, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1056 SDtfs, 2054 SDslu, 1558 SDs, 0 SdLazy, 2261 SolverSat, 252 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 2.7s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT1 conc0 concLT6 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf97 lsp71 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp98 dnf100 smp100 tf105 neg99 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...