./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loop-invgen/nested6_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/nested6_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/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 934ee9c856a834ce808d29dea79c6912619f897f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:34:40,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:34:40,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:34:40,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:34:40,163 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:34:40,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:34:40,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:34:40,165 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:34:40,166 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:34:40,167 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:34:40,167 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:34:40,167 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:34:40,168 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:34:40,169 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:34:40,169 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:34:40,170 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:34:40,170 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:34:40,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:34:40,173 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:34:40,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:34:40,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:34:40,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:34:40,176 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:34:40,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:34:40,177 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:34:40,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:34:40,178 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:34:40,178 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:34:40,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:34:40,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:34:40,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:34:40,180 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:34:40,180 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:34:40,180 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:34:40,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:34:40,181 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:34:40,182 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 13:34:40,192 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:34:40,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:34:40,193 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:34:40,193 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:34:40,194 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:34:40,194 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:34:40,194 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:34:40,194 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:34:40,194 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:34:40,194 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:34:40,194 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:34:40,195 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:34:40,195 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:34:40,195 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:34:40,195 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:34:40,195 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:34:40,195 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:34:40,195 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:34:40,195 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:34:40,196 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:34:40,196 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:34:40,196 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:34:40,196 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:34:40,196 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:34:40,196 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:34:40,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:34:40,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:34:40,197 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:34:40,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:34:40,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:34:40,197 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:34:40,198 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:34:40,198 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_21c003fc-c66d-41e1-8324-5bc294b00c81/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 -> 934ee9c856a834ce808d29dea79c6912619f897f [2018-11-18 13:34:40,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:34:40,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:34:40,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:34:40,230 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:34:40,230 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:34:40,231 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-18 13:34:40,274 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/data/fa0df256c/d38ed574e2b048049c226f3d45fc0850/FLAGd93e04ff6 [2018-11-18 13:34:40,678 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:34:40,678 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/sv-benchmarks/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-18 13:34:40,682 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/data/fa0df256c/d38ed574e2b048049c226f3d45fc0850/FLAGd93e04ff6 [2018-11-18 13:34:40,691 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/data/fa0df256c/d38ed574e2b048049c226f3d45fc0850 [2018-11-18 13:34:40,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:34:40,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:34:40,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:34:40,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:34:40,697 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:34:40,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:34:40" (1/1) ... [2018-11-18 13:34:40,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22909f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40, skipping insertion in model container [2018-11-18 13:34:40,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:34:40" (1/1) ... [2018-11-18 13:34:40,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:34:40,718 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:34:40,821 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:34:40,823 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:34:40,833 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:34:40,843 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:34:40,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40 WrapperNode [2018-11-18 13:34:40,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:34:40,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:34:40,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:34:40,844 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:34:40,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40" (1/1) ... [2018-11-18 13:34:40,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40" (1/1) ... [2018-11-18 13:34:40,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:34:40,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:34:40,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:34:40,866 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:34:40,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40" (1/1) ... [2018-11-18 13:34:40,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40" (1/1) ... [2018-11-18 13:34:40,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40" (1/1) ... [2018-11-18 13:34:40,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40" (1/1) ... [2018-11-18 13:34:40,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40" (1/1) ... [2018-11-18 13:34:40,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40" (1/1) ... [2018-11-18 13:34:40,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40" (1/1) ... [2018-11-18 13:34:40,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:34:40,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:34:40,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:34:40,879 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:34:40,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:40,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:34:40,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:34:41,062 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:34:41,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:34:41 BoogieIcfgContainer [2018-11-18 13:34:41,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:34:41,063 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:34:41,063 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:34:41,065 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:34:41,066 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:34:41,066 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:34:40" (1/3) ... [2018-11-18 13:34:41,067 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70942bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:34:41, skipping insertion in model container [2018-11-18 13:34:41,067 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:34:41,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:40" (2/3) ... [2018-11-18 13:34:41,067 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70942bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:34:41, skipping insertion in model container [2018-11-18 13:34:41,067 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:34:41,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:34:41" (3/3) ... [2018-11-18 13:34:41,068 INFO L375 chiAutomizerObserver]: Analyzing ICFG nested6_true-unreach-call_true-termination.i [2018-11-18 13:34:41,102 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:34:41,103 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:34:41,103 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:34:41,103 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:34:41,103 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:34:41,103 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:34:41,103 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:34:41,103 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:34:41,103 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:34:41,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-18 13:34:41,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-18 13:34:41,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:34:41,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:34:41,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:34:41,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:34:41,130 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:34:41,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-18 13:34:41,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-18 13:34:41,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:34:41,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:34:41,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:34:41,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:34:41,139 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 17#L14true assume !!(main_~n~0 < 1000000); 19#L15true assume main_~k~0 == main_~n~0; 29#L15-1true main_~i~0 := 0; 20#L19-4true [2018-11-18 13:34:41,139 INFO L796 eck$LassoCheckResult]: Loop: 20#L19-4true assume true; 22#L19-1true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 4#L20-4true assume !true; 21#L19-3true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 20#L19-4true [2018-11-18 13:34:41,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,143 INFO L82 PathProgramCache]: Analyzing trace with hash 28695784, now seen corresponding path program 1 times [2018-11-18 13:34:41,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1484584, now seen corresponding path program 1 times [2018-11-18 13:34:41,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:41,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:41,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:34:41,232 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:34:41,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 13:34:41,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 13:34:41,242 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-18 13:34:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:41,247 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-18 13:34:41,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:34:41,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-18 13:34:41,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-18 13:34:41,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 24 transitions. [2018-11-18 13:34:41,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 13:34:41,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 13:34:41,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-11-18 13:34:41,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:34:41,253 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-18 13:34:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-11-18 13:34:41,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 13:34:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 13:34:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-18 13:34:41,270 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-18 13:34:41,270 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-18 13:34:41,270 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:34:41,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2018-11-18 13:34:41,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-18 13:34:41,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:34:41,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:34:41,271 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:34:41,271 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:34:41,272 INFO L794 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 78#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 79#L14 assume !!(main_~n~0 < 1000000); 64#L15 assume main_~k~0 == main_~n~0; 65#L15-1 main_~i~0 := 0; 66#L19-4 [2018-11-18 13:34:41,272 INFO L796 eck$LassoCheckResult]: Loop: 66#L19-4 assume true; 67#L19-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 68#L20-4 assume true; 69#L20-1 assume !(main_~j~0 < main_~n~0); 70#L19-3 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 66#L19-4 [2018-11-18 13:34:41,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,272 INFO L82 PathProgramCache]: Analyzing trace with hash 28695784, now seen corresponding path program 2 times [2018-11-18 13:34:41,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,277 INFO L82 PathProgramCache]: Analyzing trace with hash 45964686, now seen corresponding path program 1 times [2018-11-18 13:34:41,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:34:41,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1098876665, now seen corresponding path program 1 times [2018-11-18 13:34:41,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:41,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:41,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:34:41,358 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:34:41,359 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:34:41,359 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:34:41,359 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:34:41,359 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:34:41,359 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:41,360 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:34:41,360 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:34:41,360 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-18 13:34:41,360 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:34:41,360 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:34:41,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:41,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:41,461 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:34:41,461 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:41,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:34:41,468 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:41,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:34:41,487 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:34:41,656 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:34:41,658 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:34:41,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:34:41,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:34:41,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:34:41,658 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:34:41,658 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:41,658 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:34:41,658 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:34:41,658 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-18 13:34:41,658 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:34:41,659 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:34:41,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:41,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:41,718 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:34:41,721 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:34:41,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:34:41,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:34:41,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:34:41,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:34:41,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:34:41,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:34:41,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:34:41,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:34:41,732 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:34:41,742 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:34:41,742 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:34:41,743 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:34:41,743 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:34:41,744 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:34:41,744 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-18 13:34:41,745 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:34:41,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:41,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:41,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:41,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:34:41,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-18 13:34:41,836 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 37 states and 44 transitions. Complement of second has 6 states. [2018-11-18 13:34:41,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:34:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:34:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-18 13:34:41,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-18 13:34:41,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:41,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-18 13:34:41,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:41,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-18 13:34:41,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:41,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-18 13:34:41,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-18 13:34:41,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2018-11-18 13:34:41,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 13:34:41,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 13:34:41,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-11-18 13:34:41,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:34:41,843 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-18 13:34:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-11-18 13:34:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-18 13:34:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 13:34:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-18 13:34:41,846 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-18 13:34:41,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:34:41,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:34:41,847 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-18 13:34:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:41,898 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-11-18 13:34:41,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:34:41,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 81 transitions. [2018-11-18 13:34:41,899 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2018-11-18 13:34:41,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 81 transitions. [2018-11-18 13:34:41,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 13:34:41,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-18 13:34:41,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 81 transitions. [2018-11-18 13:34:41,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:34:41,900 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 81 transitions. [2018-11-18 13:34:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 81 transitions. [2018-11-18 13:34:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2018-11-18 13:34:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 13:34:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-18 13:34:41,903 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-18 13:34:41,903 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-18 13:34:41,903 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:34:41,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-11-18 13:34:41,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-18 13:34:41,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:34:41,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:34:41,904 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:34:41,904 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 13:34:41,904 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 313#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 314#L14 assume !!(main_~n~0 < 1000000); 284#L15 assume main_~k~0 == main_~n~0; 285#L15-1 main_~i~0 := 0; 286#L19-4 assume true; 288#L19-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 291#L20-4 [2018-11-18 13:34:41,904 INFO L796 eck$LassoCheckResult]: Loop: 291#L20-4 assume true; 292#L20-1 assume !!(main_~j~0 < main_~n~0); 305#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 301#L22-4 assume true; 302#L22-1 assume !(main_~k~0 < main_~n~0); 296#L20-3 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 291#L20-4 [2018-11-18 13:34:41,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1806845229, now seen corresponding path program 1 times [2018-11-18 13:34:41,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1691124979, now seen corresponding path program 1 times [2018-11-18 13:34:41,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:41,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:41,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:34:41,932 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:34:41,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:34:41,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:34:41,932 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 13:34:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:41,961 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-18 13:34:41,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:34:41,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2018-11-18 13:34:41,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-18 13:34:41,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2018-11-18 13:34:41,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 13:34:41,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 13:34:41,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2018-11-18 13:34:41,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:34:41,964 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-18 13:34:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2018-11-18 13:34:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-18 13:34:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 13:34:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-18 13:34:41,967 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-18 13:34:41,967 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-18 13:34:41,967 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:34:41,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2018-11-18 13:34:41,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-18 13:34:41,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:34:41,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:34:41,968 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:34:41,968 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:34:41,969 INFO L794 eck$LassoCheckResult]: Stem: 414#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 402#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 403#L14 assume !!(main_~n~0 < 1000000); 375#L15 assume main_~k~0 == main_~n~0; 376#L15-1 main_~i~0 := 0; 377#L19-4 assume true; 378#L19-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 382#L20-4 [2018-11-18 13:34:41,969 INFO L796 eck$LassoCheckResult]: Loop: 382#L20-4 assume true; 383#L20-1 assume !!(main_~j~0 < main_~n~0); 396#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 407#L4-3 assume !(0 == __VERIFIER_assert_~cond); 404#L4-5 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 400#L4-6 assume !(0 == __VERIFIER_assert_~cond); 390#L4-8 assume { :end_inline___VERIFIER_assert } true; 387#L20-3 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 382#L20-4 [2018-11-18 13:34:41,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1806845229, now seen corresponding path program 2 times [2018-11-18 13:34:41,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1849498602, now seen corresponding path program 1 times [2018-11-18 13:34:41,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:34:41,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,987 INFO L82 PathProgramCache]: Analyzing trace with hash 421739842, now seen corresponding path program 1 times [2018-11-18 13:34:41,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:42,060 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:34:42,061 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:34:42,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:34:42,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:34:42,061 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:34:42,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:42,061 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:34:42,061 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:34:42,061 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration4_Loop [2018-11-18 13:34:42,061 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:34:42,061 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:34:42,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-11-18 13:34:42,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:42,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:42,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:42,107 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:34:42,107 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:42,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:34:42,109 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:34:42,112 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:34:42,112 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_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:42,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:34:42,132 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:42,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:34:42,157 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:34:42,399 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:34:42,401 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:34:42,401 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:34:42,401 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:34:42,401 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:34:42,401 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:34:42,401 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:42,401 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:34:42,401 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:34:42,401 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration4_Loop [2018-11-18 13:34:42,401 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:34:42,402 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:34:42,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:42,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:42,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:42,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:42,441 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:34:42,441 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:34:42,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:34:42,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:34:42,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:34:42,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:34:42,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:34:42,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:34:42,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:34:42,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:34:42,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:34:42,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:34:42,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:34:42,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:34:42,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:34:42,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:34:42,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:34:42,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:34:42,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:34:42,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:34:42,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:34:42,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:34:42,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:34:42,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:34:42,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:34:42,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:34:42,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:34:42,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:34:42,455 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:34:42,459 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:34:42,459 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:34:42,460 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:34:42,460 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:34:42,460 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:34:42,460 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-18 13:34:42,460 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:34:42,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:42,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:42,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:42,513 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:34:42,513 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 13:34:42,536 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 112 states and 131 transitions. Complement of second has 7 states. [2018-11-18 13:34:42,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:34:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:34:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-18 13:34:42,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-18 13:34:42,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:42,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-18 13:34:42,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:42,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 16 letters. [2018-11-18 13:34:42,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:42,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 131 transitions. [2018-11-18 13:34:42,540 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 13:34:42,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 89 states and 104 transitions. [2018-11-18 13:34:42,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 13:34:42,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-18 13:34:42,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 104 transitions. [2018-11-18 13:34:42,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:34:42,542 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-11-18 13:34:42,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 104 transitions. [2018-11-18 13:34:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2018-11-18 13:34:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 13:34:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2018-11-18 13:34:42,546 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-11-18 13:34:42,546 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-11-18 13:34:42,546 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:34:42,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. [2018-11-18 13:34:42,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 13:34:42,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:34:42,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:34:42,548 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:34:42,548 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:34:42,548 INFO L794 eck$LassoCheckResult]: Stem: 641#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 634#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 635#L14 assume !!(main_~n~0 < 1000000); 605#L15 assume main_~k~0 == main_~n~0; 606#L15-1 main_~i~0 := 0; 599#L19-4 assume true; 600#L19-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 607#L20-4 assume true; 609#L20-1 assume !!(main_~j~0 < main_~n~0); 638#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 618#L22-4 [2018-11-18 13:34:42,548 INFO L796 eck$LassoCheckResult]: Loop: 618#L22-4 assume true; 619#L22-1 assume !!(main_~k~0 < main_~n~0);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 636#L4 assume !(0 == __VERIFIER_assert_~cond); 644#L4-2 assume { :end_inline___VERIFIER_assert } true; 622#L22-3 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 618#L22-4 [2018-11-18 13:34:42,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1098876655, now seen corresponding path program 1 times [2018-11-18 13:34:42,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:42,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:42,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:42,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash 66008015, now seen corresponding path program 1 times [2018-11-18 13:34:42,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:42,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:42,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:42,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:42,574 INFO L82 PathProgramCache]: Analyzing trace with hash -350231361, now seen corresponding path program 1 times [2018-11-18 13:34:42,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:42,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:42,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:42,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:42,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:42,609 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:34:42,609 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:34:42,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:34:42,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:34:42,609 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:34:42,609 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:42,609 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:34:42,609 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:34:42,609 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-18 13:34:42,609 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:34:42,610 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:34:42,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:42,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:42,678 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:34:42,679 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:42,680 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:34:42,680 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:34:42,682 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:34:42,682 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_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:42,697 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:34:42,697 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:42,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:34:42,720 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:34:42,967 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:34:42,968 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:34:42,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:34:42,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:34:42,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:34:42,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:34:42,969 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:42,969 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:34:42,969 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:34:42,969 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-18 13:34:42,969 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:34:42,969 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:34:42,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:42,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:43,013 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:34:43,013 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:34:43,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:34:43,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:34:43,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:34:43,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:34:43,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:34:43,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:34:43,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:34:43,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:34:43,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:34:43,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:34:43,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:34:43,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:34:43,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:34:43,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:34:43,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:34:43,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:34:43,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:34:43,023 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:34:43,027 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:34:43,028 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:34:43,028 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:34:43,028 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:34:43,028 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:34:43,028 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-18 13:34:43,029 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:34:43,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:43,051 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:34:43,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 19 Second operand 4 states. [2018-11-18 13:34:43,080 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 257 states and 303 transitions. Complement of second has 7 states. [2018-11-18 13:34:43,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:34:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:34:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-18 13:34:43,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-18 13:34:43,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:43,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-18 13:34:43,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:43,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 10 letters. Loop has 10 letters. [2018-11-18 13:34:43,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:43,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 303 transitions. [2018-11-18 13:34:43,084 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2018-11-18 13:34:43,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 190 states and 222 transitions. [2018-11-18 13:34:43,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-18 13:34:43,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-18 13:34:43,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 222 transitions. [2018-11-18 13:34:43,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:34:43,086 INFO L705 BuchiCegarLoop]: Abstraction has 190 states and 222 transitions. [2018-11-18 13:34:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 222 transitions. [2018-11-18 13:34:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 147. [2018-11-18 13:34:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-18 13:34:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2018-11-18 13:34:43,092 INFO L728 BuchiCegarLoop]: Abstraction has 147 states and 171 transitions. [2018-11-18 13:34:43,092 INFO L608 BuchiCegarLoop]: Abstraction has 147 states and 171 transitions. [2018-11-18 13:34:43,092 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 13:34:43,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 171 transitions. [2018-11-18 13:34:43,093 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2018-11-18 13:34:43,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:34:43,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:34:43,094 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:34:43,094 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:34:43,094 INFO L794 eck$LassoCheckResult]: Stem: 1053#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1044#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 1045#L14 assume !!(main_~n~0 < 1000000); 1013#L15 assume main_~k~0 == main_~n~0; 1014#L15-1 main_~i~0 := 0; 1007#L19-4 assume true; 1009#L19-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1116#L20-4 assume true; 1114#L20-1 assume !!(main_~j~0 < main_~n~0); 1115#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1106#L4-3 assume !(0 == __VERIFIER_assert_~cond); 1107#L4-5 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1096#L4-6 assume !(0 == __VERIFIER_assert_~cond); 1097#L4-8 assume { :end_inline___VERIFIER_assert } true; 1091#L20-3 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1092#L20-4 assume true; 1086#L20-1 assume !(main_~j~0 < main_~n~0); 1085#L19-3 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1010#L19-4 assume true; 1011#L19-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1022#L20-4 [2018-11-18 13:34:43,094 INFO L796 eck$LassoCheckResult]: Loop: 1022#L20-4 assume true; 1076#L20-1 assume !!(main_~j~0 < main_~n~0); 1048#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1049#L4-3 assume !(0 == __VERIFIER_assert_~cond); 1079#L4-5 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1078#L4-6 assume !(0 == __VERIFIER_assert_~cond); 1077#L4-8 assume { :end_inline___VERIFIER_assert } true; 1021#L20-3 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1022#L20-4 [2018-11-18 13:34:43,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1366941033, now seen corresponding path program 1 times [2018-11-18 13:34:43,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:43,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:43,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:43,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:43,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:43,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:34:43,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:34:43,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:43,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:34:43,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-18 13:34:43,213 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:34:43,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:43,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1849498602, now seen corresponding path program 2 times [2018-11-18 13:34:43,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:43,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:43,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:43,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:43,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:43,258 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:34:43,258 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:34:43,258 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:34:43,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:34:43,259 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:34:43,259 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:43,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:34:43,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:34:43,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-18 13:34:43,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:34:43,259 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:34:43,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:43,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:43,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:43,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:43,316 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:34:43,316 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:43,320 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:34:43,320 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:34:43,322 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:34:43,322 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:43,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:34:43,340 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:34:43,342 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:34:43,342 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_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:43,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:34:43,367 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:43,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:34:43,385 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:34:43,636 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:34:43,638 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:34:43,638 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:34:43,638 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:34:43,638 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:34:43,638 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:34:43,638 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:43,638 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:34:43,638 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:34:43,638 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-18 13:34:43,638 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:34:43,639 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:34:43,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:43,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:43,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:43,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:43,689 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:34:43,690 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:34:43,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:34:43,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:34:43,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:34:43,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:34:43,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:34:43,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:34:43,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:34:43,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:34:43,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:34:43,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:34:43,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:34:43,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:34:43,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:34:43,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:34:43,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:34:43,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:34:43,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:34:43,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:34:43,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:34:43,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:34:43,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:34:43,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:34:43,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:34:43,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:34:43,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:34:43,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:34:43,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:34:43,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:34:43,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:34:43,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:34:43,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:34:43,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:34:43,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:34:43,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:34:43,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:34:43,701 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:34:43,703 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:34:43,703 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:34:43,703 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:34:43,703 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:34:43,703 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:34:43,703 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-18 13:34:43,704 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:34:43,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:43,730 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:34:43,730 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 171 transitions. cyclomatic complexity: 37 Second operand 4 states. [2018-11-18 13:34:43,760 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 171 transitions. cyclomatic complexity: 37. Second operand 4 states. Result 228 states and 265 transitions. Complement of second has 7 states. [2018-11-18 13:34:43,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:34:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:34:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-18 13:34:43,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 20 letters. Loop has 8 letters. [2018-11-18 13:34:43,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:43,761 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:34:43,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:43,785 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:34:43,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 171 transitions. cyclomatic complexity: 37 Second operand 4 states. [2018-11-18 13:34:43,819 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 171 transitions. cyclomatic complexity: 37. Second operand 4 states. Result 228 states and 265 transitions. Complement of second has 7 states. [2018-11-18 13:34:43,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:34:43,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:34:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-18 13:34:43,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 20 letters. Loop has 8 letters. [2018-11-18 13:34:43,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:43,820 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:34:43,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:43,851 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 2 loop predicates [2018-11-18 13:34:43,851 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 171 transitions. cyclomatic complexity: 37 Second operand 4 states. [2018-11-18 13:34:43,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 171 transitions. cyclomatic complexity: 37. Second operand 4 states. Result 278 states and 325 transitions. Complement of second has 6 states. [2018-11-18 13:34:43,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:34:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:34:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-18 13:34:43,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 20 letters. Loop has 8 letters. [2018-11-18 13:34:43,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:43,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-18 13:34:43,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:43,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 20 letters. Loop has 16 letters. [2018-11-18 13:34:43,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:43,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 325 transitions. [2018-11-18 13:34:43,868 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 13:34:43,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 160 states and 186 transitions. [2018-11-18 13:34:43,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-18 13:34:43,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 13:34:43,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 186 transitions. [2018-11-18 13:34:43,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:34:43,870 INFO L705 BuchiCegarLoop]: Abstraction has 160 states and 186 transitions. [2018-11-18 13:34:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 186 transitions. [2018-11-18 13:34:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 87. [2018-11-18 13:34:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-18 13:34:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2018-11-18 13:34:43,876 INFO L728 BuchiCegarLoop]: Abstraction has 87 states and 102 transitions. [2018-11-18 13:34:43,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:34:43,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:34:43,877 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand 11 states. [2018-11-18 13:34:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:43,931 INFO L93 Difference]: Finished difference Result 267 states and 306 transitions. [2018-11-18 13:34:43,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:34:43,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 306 transitions. [2018-11-18 13:34:43,933 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-11-18 13:34:43,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 257 states and 296 transitions. [2018-11-18 13:34:43,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 13:34:43,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-18 13:34:43,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 257 states and 296 transitions. [2018-11-18 13:34:43,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:34:43,935 INFO L705 BuchiCegarLoop]: Abstraction has 257 states and 296 transitions. [2018-11-18 13:34:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states and 296 transitions. [2018-11-18 13:34:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 104. [2018-11-18 13:34:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-18 13:34:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2018-11-18 13:34:43,939 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 121 transitions. [2018-11-18 13:34:43,939 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 121 transitions. [2018-11-18 13:34:43,939 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 13:34:43,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 121 transitions. [2018-11-18 13:34:43,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 13:34:43,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:34:43,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:34:43,940 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:34:43,940 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:34:43,941 INFO L794 eck$LassoCheckResult]: Stem: 2635#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2630#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 2631#L14 assume !!(main_~n~0 < 1000000); 2603#L15 assume main_~k~0 == main_~n~0; 2604#L15-1 main_~i~0 := 0; 2605#L19-4 assume true; 2606#L19-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2610#L20-4 assume true; 2611#L20-1 assume !!(main_~j~0 < main_~n~0); 2627#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 2619#L22-4 assume true; 2620#L22-1 assume !!(main_~k~0 < main_~n~0);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2633#L4 assume !(0 == __VERIFIER_assert_~cond); 2637#L4-2 assume { :end_inline___VERIFIER_assert } true; 2623#L22-3 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 2624#L22-4 assume true; 2684#L22-1 assume !(main_~k~0 < main_~n~0); 2654#L20-3 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 2640#L20-4 assume true; 2625#L20-1 assume !!(main_~j~0 < main_~n~0); 2626#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 2617#L22-4 [2018-11-18 13:34:43,941 INFO L796 eck$LassoCheckResult]: Loop: 2617#L22-4 assume true; 2618#L22-1 assume !!(main_~k~0 < main_~n~0);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2632#L4 assume !(0 == __VERIFIER_assert_~cond); 2636#L4-2 assume { :end_inline___VERIFIER_assert } true; 2622#L22-3 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 2617#L22-4 [2018-11-18 13:34:43,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:43,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1586620147, now seen corresponding path program 1 times [2018-11-18 13:34:43,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:43,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:43,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:43,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:34:43,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:43,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:34:43,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:34:43,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:44,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:34:44,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-18 13:34:44,006 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:34:44,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:44,006 INFO L82 PathProgramCache]: Analyzing trace with hash 66008015, now seen corresponding path program 2 times [2018-11-18 13:34:44,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:44,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:44,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:44,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:44,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:34:44,021 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:34:44,021 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:34:44,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:34:44,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:34:44,022 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:34:44,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:44,022 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:34:44,022 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:34:44,022 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration7_Loop [2018-11-18 13:34:44,022 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:34:44,022 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:34:44,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:44,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:44,058 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:34:44,058 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:44,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:34:44,072 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_21c003fc-c66d-41e1-8324-5bc294b00c81/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-11-18 13:34:44,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:34:44,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:34:44,305 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:34:44,307 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:34:44,307 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:34:44,307 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:34:44,307 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:34:44,307 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:34:44,307 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:34:44,307 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:34:44,307 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:34:44,307 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration7_Loop [2018-11-18 13:34:44,307 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:34:44,308 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:34:44,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:44,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:34:44,340 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:34:44,340 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:34:44,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:34:44,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:34:44,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:34:44,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:34:44,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:34:44,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:34:44,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:34:44,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:34:44,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:34:44,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:34:44,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:34:44,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:34:44,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:34:44,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:34:44,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:34:44,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:34:44,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:34:44,346 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:34:44,355 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:34:44,355 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:34:44,356 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:34:44,356 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:34:44,356 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:34:44,356 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-18 13:34:44,356 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:34:44,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:44,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:44,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:44,375 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:34:44,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 121 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-18 13:34:44,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 121 transitions. cyclomatic complexity: 25. Second operand 4 states. Result 178 states and 211 transitions. Complement of second has 7 states. [2018-11-18 13:34:44,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:34:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:34:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-18 13:34:44,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-18 13:34:44,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:44,392 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:34:44,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:44,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:44,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:44,413 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:34:44,413 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 121 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-18 13:34:44,424 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 121 transitions. cyclomatic complexity: 25. Second operand 4 states. Result 178 states and 211 transitions. Complement of second has 7 states. [2018-11-18 13:34:44,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:34:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:34:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-18 13:34:44,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-18 13:34:44,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:44,425 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:34:44,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:44,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:44,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:44,444 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 2 loop predicates [2018-11-18 13:34:44,444 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 121 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-18 13:34:44,463 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 121 transitions. cyclomatic complexity: 25. Second operand 4 states. Result 169 states and 201 transitions. Complement of second has 6 states. [2018-11-18 13:34:44,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:34:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:34:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-18 13:34:44,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-18 13:34:44,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:44,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 26 letters. Loop has 5 letters. [2018-11-18 13:34:44,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:44,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-18 13:34:44,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:34:44,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 201 transitions. [2018-11-18 13:34:44,465 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:34:44,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 0 states and 0 transitions. [2018-11-18 13:34:44,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:34:44,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:34:44,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:34:44,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:34:44,465 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:34:44,465 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:34:44,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:34:44,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:34:44,465 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2018-11-18 13:34:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:44,465 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 13:34:44,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:34:44,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 13:34:44,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:34:44,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:34:44,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:34:44,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:34:44,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:34:44,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:34:44,466 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:34:44,466 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:34:44,466 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:34:44,466 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 13:34:44,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:34:44,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:34:44,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:34:44,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:34:44 BoogieIcfgContainer [2018-11-18 13:34:44,471 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:34:44,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:34:44,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:34:44,471 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:34:44,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:34:41" (3/4) ... [2018-11-18 13:34:44,474 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:34:44,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:34:44,474 INFO L168 Benchmark]: Toolchain (without parser) took 3780.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -111.0 MB). Peak memory consumption was 119.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:34:44,475 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:34:44,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.73 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:34:44,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.88 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:34:44,476 INFO L168 Benchmark]: Boogie Preprocessor took 12.13 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:34:44,476 INFO L168 Benchmark]: RCFGBuilder took 184.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -208.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-18 13:34:44,477 INFO L168 Benchmark]: BuchiAutomizer took 3407.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 59.2 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 83.6 MB). Peak memory consumption was 142.9 MB. Max. memory is 11.5 GB. [2018-11-18 13:34:44,477 INFO L168 Benchmark]: Witness Printer took 2.75 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:34:44,479 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 148.73 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 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 21.88 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.13 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 184.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -208.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3407.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 59.2 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 83.6 MB). Peak memory consumption was 142.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.75 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (5 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * j + n and consists of 4 locations. One deterministic module has affine ranking function -1 * k + n and consists of 4 locations. One nondeterministic module has affine ranking function n + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function -1 * k + n and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 306 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 147 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 306 SDtfs, 457 SDslu, 217 SDs, 0 SdLazy, 280 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf98 lsp85 ukn100 mio100 lsp100 div100 bol100 ite114 ukn100 eq152 hnf93 smp82 dnf98 smp100 tf107 neg98 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...