./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/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_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/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-1dbac8b [2018-11-10 04:46:09,311 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:46:09,313 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:46:09,321 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:46:09,321 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:46:09,322 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:46:09,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:46:09,324 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:46:09,325 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:46:09,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:46:09,327 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:46:09,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:46:09,327 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:46:09,328 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:46:09,329 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:46:09,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:46:09,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:46:09,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:46:09,332 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:46:09,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:46:09,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:46:09,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:46:09,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:46:09,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:46:09,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:46:09,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:46:09,338 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:46:09,339 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:46:09,340 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:46:09,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:46:09,341 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:46:09,341 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:46:09,341 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:46:09,341 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:46:09,342 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:46:09,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:46:09,343 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 04:46:09,354 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:46:09,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:46:09,355 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:46:09,355 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:46:09,355 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:46:09,355 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:46:09,355 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:46:09,355 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:46:09,356 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:46:09,356 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:46:09,356 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:46:09,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:46:09,356 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:46:09,356 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:46:09,356 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:46:09,357 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:46:09,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:46:09,357 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:46:09,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:46:09,357 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:46:09,357 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:46:09,357 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:46:09,357 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:46:09,358 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:46:09,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:46:09,358 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:46:09,358 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:46:09,358 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:46:09,358 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:46:09,358 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:46:09,359 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:46:09,359 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_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/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-10 04:46:09,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:46:09,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:46:09,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:46:09,395 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:46:09,396 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:46:09,396 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-10 04:46:09,441 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/data/2e3fb8bdb/bd9ff531888141fdb8319d03ba3e0890/FLAGf1960183c [2018-11-10 04:46:09,838 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:46:09,838 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/sv-benchmarks/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-10 04:46:09,842 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/data/2e3fb8bdb/bd9ff531888141fdb8319d03ba3e0890/FLAGf1960183c [2018-11-10 04:46:09,850 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/data/2e3fb8bdb/bd9ff531888141fdb8319d03ba3e0890 [2018-11-10 04:46:09,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:46:09,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:46:09,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:46:09,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:46:09,857 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:46:09,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:46:09" (1/1) ... [2018-11-10 04:46:09,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d995a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09, skipping insertion in model container [2018-11-10 04:46:09,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:46:09" (1/1) ... [2018-11-10 04:46:09,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:46:09,880 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:46:09,978 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:46:09,980 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:46:09,989 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:46:09,997 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:46:09,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09 WrapperNode [2018-11-10 04:46:09,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:46:09,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:46:09,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:46:09,998 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:46:10,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09" (1/1) ... [2018-11-10 04:46:10,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09" (1/1) ... [2018-11-10 04:46:10,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:46:10,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:46:10,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:46:10,015 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:46:10,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09" (1/1) ... [2018-11-10 04:46:10,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09" (1/1) ... [2018-11-10 04:46:10,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09" (1/1) ... [2018-11-10 04:46:10,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09" (1/1) ... [2018-11-10 04:46:10,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09" (1/1) ... [2018-11-10 04:46:10,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09" (1/1) ... [2018-11-10 04:46:10,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09" (1/1) ... [2018-11-10 04:46:10,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:46:10,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:46:10,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:46:10,027 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:46:10,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:10,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:46:10,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:46:10,207 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:46:10,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:46:10 BoogieIcfgContainer [2018-11-10 04:46:10,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:46:10,208 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:46:10,208 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:46:10,211 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:46:10,211 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:46:10,211 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:46:09" (1/3) ... [2018-11-10 04:46:10,212 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5de7b4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:46:10, skipping insertion in model container [2018-11-10 04:46:10,212 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:46:10,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:09" (2/3) ... [2018-11-10 04:46:10,213 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5de7b4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:46:10, skipping insertion in model container [2018-11-10 04:46:10,213 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:46:10,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:46:10" (3/3) ... [2018-11-10 04:46:10,215 INFO L375 chiAutomizerObserver]: Analyzing ICFG nested6_true-unreach-call_true-termination.i [2018-11-10 04:46:10,253 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:46:10,254 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:46:10,254 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:46:10,254 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:46:10,254 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:46:10,254 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:46:10,254 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:46:10,254 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:46:10,254 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:46:10,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 04:46:10,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 04:46:10,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:10,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:10,280 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:46:10,280 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 04:46:10,280 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:46:10,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 04:46:10,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 04:46:10,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:10,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:10,282 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:46:10,282 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 04:46:10,286 INFO L793 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-10 04:46:10,287 INFO L795 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 := main_#t~post3 + 1;havoc main_#t~post3; 20#L19-4true [2018-11-10 04:46:10,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:10,290 INFO L82 PathProgramCache]: Analyzing trace with hash 28695784, now seen corresponding path program 1 times [2018-11-10 04:46:10,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:10,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:10,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:10,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:10,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:10,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:10,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1484584, now seen corresponding path program 1 times [2018-11-10 04:46:10,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:10,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:10,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:10,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:10,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:10,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:46:10,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:46:10,377 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:46:10,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 04:46:10,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 04:46:10,387 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 04:46:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:46:10,392 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 04:46:10,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:46:10,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 04:46:10,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 04:46:10,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 24 transitions. [2018-11-10 04:46:10,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 04:46:10,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 04:46:10,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-11-10 04:46:10,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:46:10,399 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 04:46:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-11-10 04:46:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 04:46:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 04:46:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-10 04:46:10,417 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 04:46:10,418 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 04:46:10,418 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:46:10,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2018-11-10 04:46:10,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 04:46:10,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:10,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:10,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:46:10,419 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:46:10,419 INFO L793 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-10 04:46:10,419 INFO L795 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 := main_#t~post3 + 1;havoc main_#t~post3; 66#L19-4 [2018-11-10 04:46:10,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:10,419 INFO L82 PathProgramCache]: Analyzing trace with hash 28695784, now seen corresponding path program 2 times [2018-11-10 04:46:10,419 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:10,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:10,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:10,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:10,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:10,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:10,424 INFO L82 PathProgramCache]: Analyzing trace with hash 45964686, now seen corresponding path program 1 times [2018-11-10 04:46:10,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:10,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:10,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:10,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:46:10,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:10,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1098876665, now seen corresponding path program 1 times [2018-11-10 04:46:10,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:10,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:10,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:10,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:10,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:10,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:46:10,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:46:10,496 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:10,497 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:10,497 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:10,497 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:10,497 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:46:10,497 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:10,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:10,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:10,498 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-10 04:46:10,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:10,498 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:10,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:10,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:10,587 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:10,588 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:10,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:46:10,593 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:10,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:46:10,625 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:46:10,920 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:46:10,921 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:10,921 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:10,921 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:10,921 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:10,921 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:46:10,921 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:10,921 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:10,922 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:10,922 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-10 04:46:10,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:10,922 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:10,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:10,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:10,970 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:10,973 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:46:10,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:10,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:10,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:10,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:10,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:10,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:10,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:10,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:10,985 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:46:10,994 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:46:10,995 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:46:10,996 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:46:10,996 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:46:10,997 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:46:10,997 INFO L519 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-10 04:46:10,997 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:46:11,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:11,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:11,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:11,045 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:46:11,045 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-10 04:46:11,082 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-10 04:46:11,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:46:11,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-10 04:46:11,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-10 04:46:11,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:11,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-10 04:46:11,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:11,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-10 04:46:11,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:11,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-10 04:46:11,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 04:46:11,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2018-11-10 04:46:11,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 04:46:11,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 04:46:11,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-11-10 04:46:11,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:46:11,088 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-10 04:46:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-11-10 04:46:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-10 04:46:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 04:46:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-10 04:46:11,091 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-10 04:46:11,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:46:11,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:46:11,091 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-10 04:46:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:46:11,136 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-11-10 04:46:11,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:46:11,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 81 transitions. [2018-11-10 04:46:11,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2018-11-10 04:46:11,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 81 transitions. [2018-11-10 04:46:11,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 04:46:11,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 04:46:11,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 81 transitions. [2018-11-10 04:46:11,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:46:11,140 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 81 transitions. [2018-11-10 04:46:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 81 transitions. [2018-11-10 04:46:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2018-11-10 04:46:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 04:46:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-10 04:46:11,143 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-10 04:46:11,143 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-10 04:46:11,143 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:46:11,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-11-10 04:46:11,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 04:46:11,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:11,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:11,144 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:11,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:46:11,145 INFO L793 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-10 04:46:11,145 INFO L795 eck$LassoCheckResult]: Loop: 291#L20-4 assume true; 292#L20-1 assume !!(main_~j~0 < main_~n~0); 305#L21 assume main_#t~nondet5 != 0;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 := main_#t~post4 + 1;havoc main_#t~post4; 291#L20-4 [2018-11-10 04:46:11,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1806845229, now seen corresponding path program 1 times [2018-11-10 04:46:11,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:11,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1691124979, now seen corresponding path program 1 times [2018-11-10 04:46:11,153 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:11,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:11,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:11,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:46:11,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:46:11,166 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:46:11,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:46:11,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:46:11,167 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-10 04:46:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:46:11,190 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-10 04:46:11,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:46:11,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2018-11-10 04:46:11,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:46:11,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2018-11-10 04:46:11,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 04:46:11,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 04:46:11,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2018-11-10 04:46:11,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:46:11,192 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-10 04:46:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2018-11-10 04:46:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-10 04:46:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 04:46:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-10 04:46:11,194 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-10 04:46:11,194 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-10 04:46:11,194 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:46:11,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2018-11-10 04:46:11,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:46:11,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:11,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:11,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:11,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:11,195 INFO L793 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-10 04:46:11,195 INFO L795 eck$LassoCheckResult]: Loop: 382#L20-4 assume true; 383#L20-1 assume !!(main_~j~0 < main_~n~0); 396#L21 assume !(main_#t~nondet5 != 0);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 !(__VERIFIER_assert_~cond == 0); 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 !(__VERIFIER_assert_~cond == 0); 390#L4-8 assume { :end_inline___VERIFIER_assert } true; 387#L20-3 main_#t~post4 := main_~j~0;main_~j~0 := main_#t~post4 + 1;havoc main_#t~post4; 382#L20-4 [2018-11-10 04:46:11,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:11,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1806845229, now seen corresponding path program 2 times [2018-11-10 04:46:11,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:11,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:11,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1849498602, now seen corresponding path program 1 times [2018-11-10 04:46:11,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:11,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:11,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:46:11,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:11,210 INFO L82 PathProgramCache]: Analyzing trace with hash 421739842, now seen corresponding path program 1 times [2018-11-10 04:46:11,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:11,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:11,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:11,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,283 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:11,283 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:11,283 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:11,283 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:11,283 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:46:11,283 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:11,283 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:11,284 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:11,284 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration4_Loop [2018-11-10 04:46:11,284 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:11,284 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:11,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:11,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:11,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:11,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:11,348 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:11,348 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:11,350 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:46:11,350 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:46:11,356 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:46:11,356 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:11,381 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:46:11,381 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:11,400 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:46:11,400 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:46:11,713 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:46:11,714 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:11,714 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:11,714 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:11,714 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:11,714 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:46:11,714 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:11,714 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:11,714 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:11,714 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration4_Loop [2018-11-10 04:46:11,714 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:11,714 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:11,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:11,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:11,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:11,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:11,762 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:11,762 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:46:11,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:11,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:11,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:11,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:11,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:11,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:11,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:11,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:11,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:11,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:11,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:11,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:11,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:11,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:11,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:11,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:11,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:11,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:11,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:11,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:11,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:11,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:11,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:11,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:11,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:11,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:11,779 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:46:11,783 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:46:11,783 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:46:11,784 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:46:11,784 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:46:11,784 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:46:11,784 INFO L519 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-10 04:46:11,784 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:46:11,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:11,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:11,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:11,833 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:46:11,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-10 04:46:11,859 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-10 04:46:11,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:46:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-10 04:46:11,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-10 04:46:11,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:11,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-10 04:46:11,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:11,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 16 letters. [2018-11-10 04:46:11,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:11,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 131 transitions. [2018-11-10 04:46:11,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 04:46:11,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 89 states and 104 transitions. [2018-11-10 04:46:11,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-10 04:46:11,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-10 04:46:11,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 104 transitions. [2018-11-10 04:46:11,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:46:11,866 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-11-10 04:46:11,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 104 transitions. [2018-11-10 04:46:11,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2018-11-10 04:46:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 04:46:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2018-11-10 04:46:11,871 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-11-10 04:46:11,871 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-11-10 04:46:11,871 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:46:11,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. [2018-11-10 04:46:11,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 04:46:11,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:11,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:11,873 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:11,873 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:46:11,873 INFO L793 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 main_#t~nondet5 != 0;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 618#L22-4 [2018-11-10 04:46:11,873 INFO L795 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 !(__VERIFIER_assert_~cond == 0); 644#L4-2 assume { :end_inline___VERIFIER_assert } true; 622#L22-3 main_#t~post6 := main_~k~0;main_~k~0 := main_#t~post6 + 1;havoc main_#t~post6; 618#L22-4 [2018-11-10 04:46:11,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:11,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1098876655, now seen corresponding path program 1 times [2018-11-10 04:46:11,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:11,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:11,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:11,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:11,881 INFO L82 PathProgramCache]: Analyzing trace with hash 66008015, now seen corresponding path program 1 times [2018-11-10 04:46:11,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:11,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:11,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:11,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:11,892 INFO L82 PathProgramCache]: Analyzing trace with hash -350231361, now seen corresponding path program 1 times [2018-11-10 04:46:11,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:11,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:11,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:11,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:11,920 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:11,920 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:11,920 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:11,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:11,920 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:46:11,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:11,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:11,921 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:11,921 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-10 04:46:11,921 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:11,921 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:11,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:11,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:11,985 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:11,985 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:11,988 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:46:11,988 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:46:12,000 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:46:12,000 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:12,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:46:12,016 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:12,040 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:46:12,040 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:46:12,384 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:46:12,386 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:12,386 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:12,386 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:12,386 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:12,386 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:46:12,387 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:12,387 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:12,387 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:12,387 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-10 04:46:12,387 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:12,387 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:12,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:12,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:12,447 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:12,447 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:46:12,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:12,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:12,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:12,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:12,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:12,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:12,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:12,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:12,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:12,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-10 04:46:12,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:12,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:12,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:12,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:12,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:12,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:12,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:12,457 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:46:12,461 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:46:12,461 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:46:12,462 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:46:12,462 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:46:12,462 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:46:12,462 INFO L519 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-10 04:46:12,462 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:46:12,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:12,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:12,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:12,489 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:46:12,489 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 19 Second operand 4 states. [2018-11-10 04:46:12,515 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-10 04:46:12,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:46:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-10 04:46:12,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-10 04:46:12,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:12,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-10 04:46:12,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:12,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 10 letters. Loop has 10 letters. [2018-11-10 04:46:12,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:12,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 303 transitions. [2018-11-10 04:46:12,521 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2018-11-10 04:46:12,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 190 states and 222 transitions. [2018-11-10 04:46:12,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-10 04:46:12,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-10 04:46:12,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 222 transitions. [2018-11-10 04:46:12,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:46:12,523 INFO L705 BuchiCegarLoop]: Abstraction has 190 states and 222 transitions. [2018-11-10 04:46:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 222 transitions. [2018-11-10 04:46:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 147. [2018-11-10 04:46:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-10 04:46:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2018-11-10 04:46:12,532 INFO L728 BuchiCegarLoop]: Abstraction has 147 states and 171 transitions. [2018-11-10 04:46:12,532 INFO L608 BuchiCegarLoop]: Abstraction has 147 states and 171 transitions. [2018-11-10 04:46:12,532 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:46:12,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 171 transitions. [2018-11-10 04:46:12,533 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2018-11-10 04:46:12,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:12,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:12,534 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-10 04:46:12,534 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:12,534 INFO L793 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 !(main_#t~nondet5 != 0);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 !(__VERIFIER_assert_~cond == 0); 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 !(__VERIFIER_assert_~cond == 0); 1097#L4-8 assume { :end_inline___VERIFIER_assert } true; 1091#L20-3 main_#t~post4 := main_~j~0;main_~j~0 := main_#t~post4 + 1;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 := main_#t~post3 + 1;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-10 04:46:12,534 INFO L795 eck$LassoCheckResult]: Loop: 1022#L20-4 assume true; 1076#L20-1 assume !!(main_~j~0 < main_~n~0); 1048#L21 assume !(main_#t~nondet5 != 0);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 !(__VERIFIER_assert_~cond == 0); 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 !(__VERIFIER_assert_~cond == 0); 1077#L4-8 assume { :end_inline___VERIFIER_assert } true; 1021#L20-3 main_#t~post4 := main_~j~0;main_~j~0 := main_#t~post4 + 1;havoc main_#t~post4; 1022#L20-4 [2018-11-10 04:46:12,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:12,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1366941033, now seen corresponding path program 1 times [2018-11-10 04:46:12,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:12,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:12,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:12,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:12,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:12,568 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-10 04:46:12,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:46:12,568 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/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-10 04:46:12,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:12,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:12,639 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-10 04:46:12,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:46:12,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-10 04:46:12,666 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:46:12,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:12,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1849498602, now seen corresponding path program 2 times [2018-11-10 04:46:12,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:12,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:12,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:12,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:12,712 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:12,712 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:12,712 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:12,713 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:12,713 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:46:12,713 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:12,713 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:12,713 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:12,713 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-10 04:46:12,713 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:12,713 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:12,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:12,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:12,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:12,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:12,760 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:12,761 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:12,776 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:46:12,776 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:46:12,779 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:46:12,779 INFO L446 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_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:12,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:46:12,797 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:46:12,800 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:46:12,800 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:12,828 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:46:12,828 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:12,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:46:12,848 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:46:13,203 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:46:13,205 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:13,205 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:13,205 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:13,205 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:13,205 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:46:13,205 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:13,205 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:13,205 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:13,206 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-10 04:46:13,206 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:13,206 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:13,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:13,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:13,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:13,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:13,246 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:13,247 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:46:13,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:13,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:13,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:13,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:13,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:13,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:13,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:13,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:13,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:13,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:13,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:13,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:13,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:13,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:13,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:13,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:13,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:13,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:13,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:13,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:13,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:13,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:13,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:13,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:13,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:13,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:13,256 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:13,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:13,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:13,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:13,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:13,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:13,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:13,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:13,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:13,260 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:46:13,263 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:46:13,263 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:46:13,264 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:46:13,264 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:46:13,264 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:46:13,264 INFO L519 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-10 04:46:13,264 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:46:13,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:13,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:13,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:13,322 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:46:13,322 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 171 transitions. cyclomatic complexity: 37 Second operand 4 states. [2018-11-10 04:46:13,351 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-10 04:46:13,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:46:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-10 04:46:13,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 20 letters. Loop has 8 letters. [2018-11-10 04:46:13,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:13,352 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:46:13,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:13,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:13,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:13,382 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-10 04:46:13,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 171 transitions. cyclomatic complexity: 37 Second operand 4 states. [2018-11-10 04:46:13,395 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-10 04:46:13,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:46:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-10 04:46:13,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 20 letters. Loop has 8 letters. [2018-11-10 04:46:13,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:13,396 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:46:13,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:13,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:13,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:13,431 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-10 04:46:13,431 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 171 transitions. cyclomatic complexity: 37 Second operand 4 states. [2018-11-10 04:46:13,451 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-10 04:46:13,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:46:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-10 04:46:13,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 20 letters. Loop has 8 letters. [2018-11-10 04:46:13,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:13,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-10 04:46:13,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:13,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 20 letters. Loop has 16 letters. [2018-11-10 04:46:13,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:13,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 325 transitions. [2018-11-10 04:46:13,456 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 04:46:13,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 160 states and 186 transitions. [2018-11-10 04:46:13,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-10 04:46:13,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-10 04:46:13,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 186 transitions. [2018-11-10 04:46:13,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:46:13,457 INFO L705 BuchiCegarLoop]: Abstraction has 160 states and 186 transitions. [2018-11-10 04:46:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 186 transitions. [2018-11-10 04:46:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 87. [2018-11-10 04:46:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-10 04:46:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2018-11-10 04:46:13,462 INFO L728 BuchiCegarLoop]: Abstraction has 87 states and 102 transitions. [2018-11-10 04:46:13,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 04:46:13,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:46:13,462 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand 11 states. [2018-11-10 04:46:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:46:13,519 INFO L93 Difference]: Finished difference Result 267 states and 306 transitions. [2018-11-10 04:46:13,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:46:13,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 306 transitions. [2018-11-10 04:46:13,521 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-11-10 04:46:13,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 257 states and 296 transitions. [2018-11-10 04:46:13,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-10 04:46:13,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-10 04:46:13,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 257 states and 296 transitions. [2018-11-10 04:46:13,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:46:13,523 INFO L705 BuchiCegarLoop]: Abstraction has 257 states and 296 transitions. [2018-11-10 04:46:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states and 296 transitions. [2018-11-10 04:46:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 104. [2018-11-10 04:46:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-10 04:46:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2018-11-10 04:46:13,529 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 121 transitions. [2018-11-10 04:46:13,529 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 121 transitions. [2018-11-10 04:46:13,529 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:46:13,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 121 transitions. [2018-11-10 04:46:13,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:46:13,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:13,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:13,530 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-10 04:46:13,530 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:46:13,530 INFO L793 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 main_#t~nondet5 != 0;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 !(__VERIFIER_assert_~cond == 0); 2637#L4-2 assume { :end_inline___VERIFIER_assert } true; 2623#L22-3 main_#t~post6 := main_~k~0;main_~k~0 := main_#t~post6 + 1;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 := main_#t~post4 + 1;havoc main_#t~post4; 2640#L20-4 assume true; 2625#L20-1 assume !!(main_~j~0 < main_~n~0); 2626#L21 assume main_#t~nondet5 != 0;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 2617#L22-4 [2018-11-10 04:46:13,530 INFO L795 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 !(__VERIFIER_assert_~cond == 0); 2636#L4-2 assume { :end_inline___VERIFIER_assert } true; 2622#L22-3 main_#t~post6 := main_~k~0;main_~k~0 := main_#t~post6 + 1;havoc main_#t~post6; 2617#L22-4 [2018-11-10 04:46:13,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1586620147, now seen corresponding path program 1 times [2018-11-10 04:46:13,531 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:13,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:13,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:13,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:46:13,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:13,553 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-10 04:46:13,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:46:13,554 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/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-10 04:46:13,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:13,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:13,572 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-10 04:46:13,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:46:13,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 04:46:13,588 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:46:13,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:13,588 INFO L82 PathProgramCache]: Analyzing trace with hash 66008015, now seen corresponding path program 2 times [2018-11-10 04:46:13,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:13,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:13,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:13,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:13,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:13,604 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:13,604 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:13,604 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:13,604 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:13,604 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:46:13,605 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:13,605 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:13,605 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:13,605 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration7_Loop [2018-11-10 04:46:13,605 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:13,605 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:13,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:13,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:13,640 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:13,640 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:13,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:46:13,641 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba1bd6f5-2075-4ba1-8704-dc85aa69a422/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-10 04:46:13,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:46:13,664 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:46:13,988 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:46:13,989 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:13,989 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:13,989 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:13,989 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:13,989 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:46:13,989 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:13,989 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:13,989 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:13,989 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration7_Loop [2018-11-10 04:46:13,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:13,990 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:13,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:13,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:14,028 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:14,028 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:46:14,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:14,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:14,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:14,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:14,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:14,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:14,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:14,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:14,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:14,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:14,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:14,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:14,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:14,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:14,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:14,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:14,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:14,035 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:46:14,038 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:46:14,038 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:46:14,038 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:46:14,039 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:46:14,039 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:46:14,039 INFO L519 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-10 04:46:14,039 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:46:14,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:14,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:14,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:14,076 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:46:14,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 121 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-10 04:46:14,094 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-10 04:46:14,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:46:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-10 04:46:14,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-10 04:46:14,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:14,095 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:46:14,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:14,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:14,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:14,114 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-10 04:46:14,114 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 121 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-10 04:46:14,128 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-10 04:46:14,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:46:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-10 04:46:14,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-10 04:46:14,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:14,129 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:46:14,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:14,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:14,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:14,149 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-10 04:46:14,149 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 121 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-10 04:46:14,169 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-10 04:46:14,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:46:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-10 04:46:14,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-10 04:46:14,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:14,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 26 letters. Loop has 5 letters. [2018-11-10 04:46:14,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:14,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-10 04:46:14,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:14,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 201 transitions. [2018-11-10 04:46:14,172 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:46:14,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 0 states and 0 transitions. [2018-11-10 04:46:14,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:46:14,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:46:14,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:46:14,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:46:14,172 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:46:14,172 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:46:14,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:46:14,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:46:14,173 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2018-11-10 04:46:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:46:14,173 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 04:46:14,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:46:14,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 04:46:14,173 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:46:14,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 04:46:14,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:46:14,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:46:14,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:46:14,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:46:14,174 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:46:14,174 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:46:14,174 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:46:14,174 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 04:46:14,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:46:14,174 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:46:14,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:46:14,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:46:14 BoogieIcfgContainer [2018-11-10 04:46:14,179 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:46:14,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:46:14,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:46:14,180 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:46:14,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:46:10" (3/4) ... [2018-11-10 04:46:14,183 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:46:14,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:46:14,183 INFO L168 Benchmark]: Toolchain (without parser) took 4330.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.5 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 101.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:14,184 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:46:14,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.26 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:14,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.47 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:46:14,185 INFO L168 Benchmark]: Boogie Preprocessor took 11.19 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:14,185 INFO L168 Benchmark]: RCFGBuilder took 180.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -222.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:14,186 INFO L168 Benchmark]: BuchiAutomizer took 3971.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 57.7 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 72.0 MB). Peak memory consumption was 129.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:14,186 INFO L168 Benchmark]: Witness Printer took 2.98 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-10 04:46:14,188 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.26 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.47 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.19 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. * RCFGBuilder took 180.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -222.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3971.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 57.7 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 72.0 MB). Peak memory consumption was 129.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.98 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.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.1s. 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.1s 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.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...