./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/Ex08_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/Ex08_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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 64bit --witnessprinter.graph.data.programhash 0f19c27ba74e1ebec32cb641e6640521812ace19 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:08:50,428 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:50,430 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:50,441 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:50,442 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:50,443 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:50,444 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:50,445 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:50,446 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:50,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:50,447 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:50,447 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:50,448 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:50,448 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:50,452 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:50,453 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:50,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:50,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:50,456 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:50,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:50,458 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:50,459 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:50,461 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:50,461 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:50,461 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:50,462 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:50,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:50,463 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:50,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:50,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:50,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:50,466 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:50,466 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:50,466 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:50,467 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:50,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:50,468 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:08:50,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:50,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:50,482 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:50,482 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:50,482 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:50,483 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:50,483 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:50,483 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:50,483 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:50,483 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:50,483 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:50,483 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:50,483 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:50,484 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:50,484 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:50,484 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:50,484 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:50,484 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:50,484 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:50,484 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:50,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:50,485 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:50,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:50,485 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:50,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:50,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:50,487 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:50,488 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:50,488 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_10416055-ff0f-4698-993a-20902ed2188f/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f19c27ba74e1ebec32cb641e6640521812ace19 [2018-10-27 06:08:50,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:50,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:50,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:50,542 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:50,542 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:50,544 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/Ex08_false-termination_true-no-overflow.c [2018-10-27 06:08:50,585 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/data/6e942f469/868a1bf619f64355aa213e5e3b25d838/FLAGd8634548c [2018-10-27 06:08:50,953 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:50,953 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/sv-benchmarks/c/termination-restricted-15/Ex08_false-termination_true-no-overflow.c [2018-10-27 06:08:50,961 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/data/6e942f469/868a1bf619f64355aa213e5e3b25d838/FLAGd8634548c [2018-10-27 06:08:50,973 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/data/6e942f469/868a1bf619f64355aa213e5e3b25d838 [2018-10-27 06:08:50,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:50,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:50,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:50,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:50,981 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:50,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:50" (1/1) ... [2018-10-27 06:08:50,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33343c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:50, skipping insertion in model container [2018-10-27 06:08:50,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:50" (1/1) ... [2018-10-27 06:08:50,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:51,007 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:51,118 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:51,120 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:51,129 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:51,137 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:51,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:51 WrapperNode [2018-10-27 06:08:51,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:51,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:51,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:51,139 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:51,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:51" (1/1) ... [2018-10-27 06:08:51,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:51" (1/1) ... [2018-10-27 06:08:51,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:51,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:51,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:51,167 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:51,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:51" (1/1) ... [2018-10-27 06:08:51,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:51" (1/1) ... [2018-10-27 06:08:51,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:51" (1/1) ... [2018-10-27 06:08:51,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:51" (1/1) ... [2018-10-27 06:08:51,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:51" (1/1) ... [2018-10-27 06:08:51,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:51" (1/1) ... [2018-10-27 06:08:51,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:51" (1/1) ... [2018-10-27 06:08:51,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:51,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:51,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:51,183 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:51,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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-10-27 06:08:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:51,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:51,498 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:51,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:51 BoogieIcfgContainer [2018-10-27 06:08:51,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:51,499 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:51,500 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:51,503 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:51,504 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:51,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:50" (1/3) ... [2018-10-27 06:08:51,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d1e96b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:51, skipping insertion in model container [2018-10-27 06:08:51,505 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:51,505 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:51" (2/3) ... [2018-10-27 06:08:51,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d1e96b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:51, skipping insertion in model container [2018-10-27 06:08:51,506 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:51,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:51" (3/3) ... [2018-10-27 06:08:51,507 INFO L375 chiAutomizerObserver]: Analyzing ICFG Ex08_false-termination_true-no-overflow.c [2018-10-27 06:08:51,557 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:51,558 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:51,558 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:51,558 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:51,558 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:51,558 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:51,558 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:51,558 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:51,558 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:51,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-10-27 06:08:51,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:51,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:51,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:51,597 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:08:51,597 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:51,598 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:51,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-10-27 06:08:51,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:51,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:51,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:51,599 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:08:51,599 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:51,608 INFO L793 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 7#L18-1true [2018-10-27 06:08:51,608 INFO L795 eck$LassoCheckResult]: Loop: 7#L18-1true assume true; 4#L11-1true assume !!(main_~i~0 > 0); 8#L12true assume !(main_~i~0 == 1); 5#L12-2true assume main_~i~0 == 10;main_~up~0 := 0; 12#L15-1true assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 7#L18-1true [2018-10-27 06:08:51,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:08:51,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:51,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:51,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:51,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:51,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:51,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:51,696 INFO L82 PathProgramCache]: Analyzing trace with hash 34544784, now seen corresponding path program 1 times [2018-10-27 06:08:51,696 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:51,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:51,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:51,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:51,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:51,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:51,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:08:51,799 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:51,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:51,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:51,815 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-10-27 06:08:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:51,902 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2018-10-27 06:08:51,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:51,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2018-10-27 06:08:51,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:08:51,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 12 states and 17 transitions. [2018-10-27 06:08:51,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-10-27 06:08:51,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-10-27 06:08:51,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2018-10-27 06:08:51,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:51,913 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-10-27 06:08:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2018-10-27 06:08:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-27 06:08:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-27 06:08:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-10-27 06:08:51,943 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-10-27 06:08:51,943 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-10-27 06:08:51,943 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:51,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2018-10-27 06:08:51,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:08:51,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:51,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:51,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:08:51,944 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:51,945 INFO L793 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 40#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 41#L18-1 [2018-10-27 06:08:51,945 INFO L795 eck$LassoCheckResult]: Loop: 41#L18-1 assume true; 42#L11-1 assume !!(main_~i~0 > 0); 43#L12 assume !(main_~i~0 == 1); 44#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 45#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 41#L18-1 [2018-10-27 06:08:51,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:51,945 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-10-27 06:08:51,948 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:51,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:51,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:51,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:51,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:51,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:51,953 INFO L82 PathProgramCache]: Analyzing trace with hash 34544786, now seen corresponding path program 1 times [2018-10-27 06:08:51,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:51,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:51,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:51,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:51,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:51,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:51,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984272, now seen corresponding path program 1 times [2018-10-27 06:08:51,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:51,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:51,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:52,062 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:52,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:52,063 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:52,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:52,063 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:08:52,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:52,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:52,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:52,063 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration2_Loop [2018-10-27 06:08:52,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:52,064 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:52,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:52,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:52,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:52,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:52,401 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:52,402 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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-10-27 06:08:52,410 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:52,410 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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-10-27 06:08:52,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:08:52,435 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:52,458 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:08:52,473 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:52,474 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:52,474 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:52,474 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:52,474 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:52,474 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:52,474 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:52,474 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:52,474 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration2_Loop [2018-10-27 06:08:52,475 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:52,475 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:52,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:52,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:52,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:52,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:52,609 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:52,612 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:52,613 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-10-27 06:08:52,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:52,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:52,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:52,624 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:52,629 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:52,629 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:52,631 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:52,631 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:08:52,632 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:52,632 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:08:52,633 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:08:52,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:52,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:52,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:52,810 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-10-27 06:08:52,810 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-10-27 06:08:52,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 31 states and 46 transitions. Complement of second has 7 states. [2018-10-27 06:08:52,908 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-10-27 06:08:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-10-27 06:08:52,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 5 letters. [2018-10-27 06:08:52,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:52,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 5 letters. [2018-10-27 06:08:52,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:52,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 10 letters. [2018-10-27 06:08:52,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:52,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 46 transitions. [2018-10-27 06:08:52,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:08:52,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 42 transitions. [2018-10-27 06:08:52,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-10-27 06:08:52,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-10-27 06:08:52,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 42 transitions. [2018-10-27 06:08:52,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:52,915 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2018-10-27 06:08:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 42 transitions. [2018-10-27 06:08:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-27 06:08:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 06:08:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2018-10-27 06:08:52,918 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2018-10-27 06:08:52,918 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2018-10-27 06:08:52,918 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:52,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2018-10-27 06:08:52,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:08:52,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:52,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:52,920 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:52,920 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:52,920 INFO L793 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 129#L18-1 assume true; 147#L11-1 assume !!(main_~i~0 > 0); 152#L12 assume main_~i~0 == 1;main_~up~0 := 1; 151#L12-2 assume !(main_~i~0 == 10); 148#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 149#L18-1 [2018-10-27 06:08:52,920 INFO L795 eck$LassoCheckResult]: Loop: 149#L18-1 assume true; 154#L11-1 assume !!(main_~i~0 > 0); 153#L12 assume !(main_~i~0 == 1); 144#L12-2 assume !(main_~i~0 == 10); 150#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 149#L18-1 [2018-10-27 06:08:52,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1805982410, now seen corresponding path program 1 times [2018-10-27 06:08:52,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:52,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:52,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:52,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:52,930 INFO L82 PathProgramCache]: Analyzing trace with hash 34544846, now seen corresponding path program 1 times [2018-10-27 06:08:52,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:52,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:52,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:52,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:52,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:52,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:52,941 INFO L82 PathProgramCache]: Analyzing trace with hash -897034331, now seen corresponding path program 1 times [2018-10-27 06:08:52,941 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:52,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:52,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:52,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:52,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:52,989 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:52,989 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:52,989 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:52,989 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:52,990 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:08:52,990 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:52,990 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:52,990 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:52,990 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration3_Loop [2018-10-27 06:08:52,990 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:52,990 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:52,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:52,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,355 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 16 [2018-10-27 06:08:53,356 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:53,357 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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-10-27 06:08:53,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:53,361 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:53,379 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:53,379 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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-10-27 06:08:53,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:53,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:53,430 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:53,430 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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) [2018-10-27 06:08:53,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:53,436 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:53,477 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:53,477 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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-10-27 06:08:53,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:53,483 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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-10-27 06:08:53,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:08:53,511 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:53,523 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:53,523 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=15} Honda state: {ULTIMATE.start_main_~i~0=15} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~i~0=1}, {ULTIMATE.start_main_~i~0=0}] Lambdas: [16, 1, 13] Nus: [0, 0] [2018-10-27 06:08:53,658 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:53,659 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:53,659 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:53,659 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:53,659 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:08:53,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:53,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:53,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:53,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration3_Lasso [2018-10-27 06:08:53,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:53,659 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:53,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,844 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:53,844 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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-10-27 06:08:53,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:53,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:53,863 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:53,863 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_4=0} Honda state: {v_rep~unnamed0~0~false_4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:53,866 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:53,867 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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) [2018-10-27 06:08:53,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:08:53,903 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:53,928 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:08:53,930 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:53,930 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:53,930 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:53,930 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:53,930 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:53,930 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:53,930 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:53,931 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:53,931 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration3_Lasso [2018-10-27 06:08:53,931 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:53,931 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:53,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,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-10-27 06:08:53,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:53,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:54,157 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:54,157 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:54,157 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-10-27 06:08:54,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:54,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:54,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:54,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:54,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:54,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:54,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:54,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:54,161 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-10-27 06:08:54,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:54,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:54,162 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:54,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:54,168 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-10-27 06:08:54,168 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:08:54,251 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:54,325 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:08:54,326 INFO L444 ModelExtractionUtils]: 0 out of 11 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-10-27 06:08:54,327 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:54,331 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-10-27 06:08:54,331 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:54,331 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [-1*ULTIMATE.start_main_~i~0 + 10 >= 0] [2018-10-27 06:08:54,357 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-10-27 06:08:54,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:54,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:54,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:54,758 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-10-27 06:08:54,758 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 42 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-10-27 06:08:54,832 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 42 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 69 states and 100 transitions. Complement of second has 9 states. [2018-10-27 06:08:54,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:08:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-10-27 06:08:54,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 7 letters. Loop has 5 letters. [2018-10-27 06:08:54,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:54,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 12 letters. Loop has 5 letters. [2018-10-27 06:08:54,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:54,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 7 letters. Loop has 10 letters. [2018-10-27 06:08:54,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:54,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 100 transitions. [2018-10-27 06:08:54,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:08:54,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 42 states and 59 transitions. [2018-10-27 06:08:54,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-10-27 06:08:54,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-10-27 06:08:54,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 59 transitions. [2018-10-27 06:08:54,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:54,841 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 59 transitions. [2018-10-27 06:08:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 59 transitions. [2018-10-27 06:08:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-10-27 06:08:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 06:08:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2018-10-27 06:08:54,844 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2018-10-27 06:08:54,844 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2018-10-27 06:08:54,844 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:54,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 57 transitions. [2018-10-27 06:08:54,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:08:54,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:54,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:54,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:54,847 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:54,847 INFO L793 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 300#L18-1 assume true; 325#L11-1 assume !!(main_~i~0 > 0); 323#L12 assume main_~i~0 == 1;main_~up~0 := 1; 321#L12-2 assume !(main_~i~0 == 10); 320#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 319#L18-1 assume true; 305#L11-1 assume !!(main_~i~0 > 0); 306#L12 assume !(main_~i~0 == 1); 314#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 302#L15-1 [2018-10-27 06:08:54,847 INFO L795 eck$LassoCheckResult]: Loop: 302#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 310#L18-1 assume true; 311#L11-1 assume !!(main_~i~0 > 0); 336#L12 assume !(main_~i~0 == 1); 301#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 302#L15-1 [2018-10-27 06:08:54,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:54,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1968599244, now seen corresponding path program 1 times [2018-10-27 06:08:54,847 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:54,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:54,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:54,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:54,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:54,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:54,880 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:54,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:54,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:54,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:54,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-27 06:08:54,923 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:54,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:54,924 INFO L82 PathProgramCache]: Analyzing trace with hash 55602086, now seen corresponding path program 2 times [2018-10-27 06:08:54,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:54,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:54,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:54,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:54,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:54,957 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:54,957 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:54,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:54,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:54,958 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:08:54,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:54,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:54,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:54,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration4_Loop [2018-10-27 06:08:54,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:54,958 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:54,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:54,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:54,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:54,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:55,008 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:55,008 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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-10-27 06:08:55,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:55,023 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:55,038 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:55,039 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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-10-27 06:08:55,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:55,056 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:55,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:08:55,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:55,175 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:08:55,176 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:55,176 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:55,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:55,176 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:55,177 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:55,177 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:55,177 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:55,177 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:55,177 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration4_Loop [2018-10-27 06:08:55,177 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:55,177 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:55,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:55,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:55,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-10-27 06:08:55,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:55,273 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:55,273 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:55,274 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-10-27 06:08:55,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:55,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:55,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:55,274 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:55,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:55,277 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:55,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:55,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:55,278 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-10-27 06:08:55,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:55,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:55,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:55,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:55,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:55,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:55,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:55,285 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:55,287 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:55,287 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:55,287 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:55,287 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:08:55,287 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:55,287 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:08:55,288 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:08:55,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:55,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:55,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:55,586 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:08:55,586 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 57 transitions. cyclomatic complexity: 21 Second operand 4 states. [2018-10-27 06:08:55,619 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 57 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 105 states and 152 transitions. Complement of second has 7 states. [2018-10-27 06:08:55,622 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-10-27 06:08:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-10-27 06:08:55,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 5 letters. [2018-10-27 06:08:55,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:55,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 5 letters. [2018-10-27 06:08:55,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:55,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 10 letters. [2018-10-27 06:08:55,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:55,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 152 transitions. [2018-10-27 06:08:55,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-10-27 06:08:55,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 86 states and 124 transitions. [2018-10-27 06:08:55,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:08:55,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-10-27 06:08:55,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 124 transitions. [2018-10-27 06:08:55,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:55,628 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 124 transitions. [2018-10-27 06:08:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 124 transitions. [2018-10-27 06:08:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-10-27 06:08:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-27 06:08:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2018-10-27 06:08:55,634 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 123 transitions. [2018-10-27 06:08:55,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:08:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:08:55,634 INFO L87 Difference]: Start difference. First operand 85 states and 123 transitions. Second operand 4 states. [2018-10-27 06:08:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:55,670 INFO L93 Difference]: Finished difference Result 129 states and 180 transitions. [2018-10-27 06:08:55,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:55,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 180 transitions. [2018-10-27 06:08:55,674 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2018-10-27 06:08:55,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 129 states and 180 transitions. [2018-10-27 06:08:55,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-10-27 06:08:55,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-10-27 06:08:55,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 180 transitions. [2018-10-27 06:08:55,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:55,676 INFO L705 BuchiCegarLoop]: Abstraction has 129 states and 180 transitions. [2018-10-27 06:08:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 180 transitions. [2018-10-27 06:08:55,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2018-10-27 06:08:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-27 06:08:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2018-10-27 06:08:55,681 INFO L728 BuchiCegarLoop]: Abstraction has 117 states and 166 transitions. [2018-10-27 06:08:55,681 INFO L608 BuchiCegarLoop]: Abstraction has 117 states and 166 transitions. [2018-10-27 06:08:55,681 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:55,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 166 transitions. [2018-10-27 06:08:55,683 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2018-10-27 06:08:55,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:55,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:55,683 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2018-10-27 06:08:55,683 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:55,684 INFO L793 eck$LassoCheckResult]: Stem: 771#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 761#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 762#L18-1 assume true; 819#L11-1 assume !!(main_~i~0 > 0); 817#L12 assume main_~i~0 == 1;main_~up~0 := 1; 815#L12-2 assume !(main_~i~0 == 10); 814#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 812#L18-1 assume true; 810#L11-1 assume !!(main_~i~0 > 0); 809#L12 assume main_~i~0 == 1;main_~up~0 := 1; 799#L12-2 assume !(main_~i~0 == 10); 806#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 794#L18-1 [2018-10-27 06:08:55,684 INFO L795 eck$LassoCheckResult]: Loop: 794#L18-1 assume true; 805#L11-1 assume !!(main_~i~0 > 0); 804#L12 assume !(main_~i~0 == 1); 785#L12-2 assume !(main_~i~0 == 10); 803#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 794#L18-1 [2018-10-27 06:08:55,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:55,684 INFO L82 PathProgramCache]: Analyzing trace with hash -897036251, now seen corresponding path program 1 times [2018-10-27 06:08:55,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:55,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:55,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:55,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:55,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:55,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:55,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:08:55,745 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:55,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash 34544848, now seen corresponding path program 1 times [2018-10-27 06:08:55,745 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:55,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:55,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:55,768 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:55,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:55,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:55,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:55,769 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:08:55,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:55,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:55,769 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:55,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration5_Loop [2018-10-27 06:08:55,769 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:55,769 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:55,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:55,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:55,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:55,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:55,841 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:55,841 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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-10-27 06:08:55,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:55,846 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/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-10-27 06:08:55,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:08:55,864 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:55,887 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:08:55,888 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:55,889 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:55,889 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:55,889 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:55,889 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:55,889 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:55,889 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:55,889 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:55,889 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration5_Loop [2018-10-27 06:08:55,889 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:55,889 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:55,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:55,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:55,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:55,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:55,974 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:55,975 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:55,975 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-10-27 06:08:55,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:55,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:55,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:55,976 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:55,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:55,976 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:55,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:55,979 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:55,981 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:55,981 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:55,985 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:55,985 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:08:55,985 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:55,985 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:08:55,985 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:08:56,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:56,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:56,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:56,038 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-10-27 06:08:56,038 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 166 transitions. cyclomatic complexity: 59 Second operand 4 states. [2018-10-27 06:08:56,058 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 166 transitions. cyclomatic complexity: 59. Second operand 4 states. Result 231 states and 327 transitions. Complement of second has 7 states. [2018-10-27 06:08:56,061 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-10-27 06:08:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-10-27 06:08:56,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 5 letters. [2018-10-27 06:08:56,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:56,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 17 letters. Loop has 5 letters. [2018-10-27 06:08:56,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:56,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 10 letters. [2018-10-27 06:08:56,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:56,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 327 transitions. [2018-10-27 06:08:56,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2018-10-27 06:08:56,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 195 states and 273 transitions. [2018-10-27 06:08:56,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2018-10-27 06:08:56,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2018-10-27 06:08:56,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 273 transitions. [2018-10-27 06:08:56,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:56,067 INFO L705 BuchiCegarLoop]: Abstraction has 195 states and 273 transitions. [2018-10-27 06:08:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 273 transitions. [2018-10-27 06:08:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2018-10-27 06:08:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-27 06:08:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 244 transitions. [2018-10-27 06:08:56,080 INFO L728 BuchiCegarLoop]: Abstraction has 173 states and 244 transitions. [2018-10-27 06:08:56,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:08:56,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:08:56,081 INFO L87 Difference]: Start difference. First operand 173 states and 244 transitions. Second operand 4 states. [2018-10-27 06:08:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:56,105 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2018-10-27 06:08:56,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:56,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 274 transitions. [2018-10-27 06:08:56,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2018-10-27 06:08:56,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 211 states and 274 transitions. [2018-10-27 06:08:56,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2018-10-27 06:08:56,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2018-10-27 06:08:56,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 211 states and 274 transitions. [2018-10-27 06:08:56,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:56,110 INFO L705 BuchiCegarLoop]: Abstraction has 211 states and 274 transitions. [2018-10-27 06:08:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 274 transitions. [2018-10-27 06:08:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 170. [2018-10-27 06:08:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-27 06:08:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 227 transitions. [2018-10-27 06:08:56,125 INFO L728 BuchiCegarLoop]: Abstraction has 170 states and 227 transitions. [2018-10-27 06:08:56,125 INFO L608 BuchiCegarLoop]: Abstraction has 170 states and 227 transitions. [2018-10-27 06:08:56,125 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:08:56,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 227 transitions. [2018-10-27 06:08:56,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-10-27 06:08:56,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:56,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:56,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2018-10-27 06:08:56,127 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2018-10-27 06:08:56,127 INFO L793 eck$LassoCheckResult]: Stem: 1578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1568#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1569#L18-1 assume true; 1651#L11-1 assume !!(main_~i~0 > 0); 1703#L12 assume main_~i~0 == 1;main_~up~0 := 1; 1702#L12-2 assume !(main_~i~0 == 10); 1701#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 1699#L18-1 assume true; 1700#L11-1 assume !!(main_~i~0 > 0); 1735#L12 assume !(main_~i~0 == 1); 1733#L12-2 assume !(main_~i~0 == 10); 1593#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 1579#L18-1 assume true; 1580#L11-1 assume !!(main_~i~0 > 0); 1729#L12 assume main_~i~0 == 1;main_~up~0 := 1; 1719#L12-2 assume !(main_~i~0 == 10); 1589#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 1590#L18-1 [2018-10-27 06:08:56,127 INFO L795 eck$LassoCheckResult]: Loop: 1590#L18-1 assume true; 1725#L11-1 assume !!(main_~i~0 > 0); 1724#L12 assume !(main_~i~0 == 1); 1723#L12-2 assume !(main_~i~0 == 10); 1714#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 1592#L18-1 assume true; 1727#L11-1 assume !!(main_~i~0 > 0); 1726#L12 assume !(main_~i~0 == 1); 1722#L12-2 assume !(main_~i~0 == 10); 1591#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 1590#L18-1 [2018-10-27 06:08:56,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:56,127 INFO L82 PathProgramCache]: Analyzing trace with hash 493458790, now seen corresponding path program 1 times [2018-10-27 06:08:56,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:56,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:56,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:56,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:56,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 06:08:56,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:56,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:08:56,147 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:56,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:56,147 INFO L82 PathProgramCache]: Analyzing trace with hash 441231711, now seen corresponding path program 1 times [2018-10-27 06:08:56,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:56,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:56,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:56,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:56,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:56,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:56,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:08:56,157 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:56,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:56,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:56,157 INFO L87 Difference]: Start difference. First operand 170 states and 227 transitions. cyclomatic complexity: 72 Second operand 3 states. [2018-10-27 06:08:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:56,170 INFO L93 Difference]: Finished difference Result 196 states and 250 transitions. [2018-10-27 06:08:56,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:56,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 250 transitions. [2018-10-27 06:08:56,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2018-10-27 06:08:56,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 186 states and 239 transitions. [2018-10-27 06:08:56,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-10-27 06:08:56,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2018-10-27 06:08:56,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 239 transitions. [2018-10-27 06:08:56,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:56,176 INFO L705 BuchiCegarLoop]: Abstraction has 186 states and 239 transitions. [2018-10-27 06:08:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 239 transitions. [2018-10-27 06:08:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 155. [2018-10-27 06:08:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-27 06:08:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 204 transitions. [2018-10-27 06:08:56,181 INFO L728 BuchiCegarLoop]: Abstraction has 155 states and 204 transitions. [2018-10-27 06:08:56,181 INFO L608 BuchiCegarLoop]: Abstraction has 155 states and 204 transitions. [2018-10-27 06:08:56,181 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:08:56,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 204 transitions. [2018-10-27 06:08:56,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-10-27 06:08:56,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:56,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:56,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:56,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:56,183 INFO L793 eck$LassoCheckResult]: Stem: 1951#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1941#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1942#L18-1 assume true; 2029#L11-1 assume !!(main_~i~0 > 0); 2039#L12 assume !(main_~i~0 == 1); 2034#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 2003#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 2004#L18-1 assume true; 2000#L11-1 assume !!(main_~i~0 > 0); 1999#L12 assume main_~i~0 == 1;main_~up~0 := 1; 1998#L12-2 assume !(main_~i~0 == 10); 1997#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 1996#L18-1 assume true; 1943#L11-1 assume !!(main_~i~0 > 0); 1944#L12 assume !(main_~i~0 == 1); 1947#L12-2 [2018-10-27 06:08:56,183 INFO L795 eck$LassoCheckResult]: Loop: 1947#L12-2 assume !(main_~i~0 == 10); 1948#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 2093#L18-1 assume true; 2095#L11-1 assume !!(main_~i~0 > 0); 2094#L12 assume !(main_~i~0 == 1); 1947#L12-2 [2018-10-27 06:08:56,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:56,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1453658702, now seen corresponding path program 1 times [2018-10-27 06:08:56,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:56,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:56,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:56,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:56,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:56,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:56,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:08:56,204 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:56,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:56,204 INFO L82 PathProgramCache]: Analyzing trace with hash 50740228, now seen corresponding path program 2 times [2018-10-27 06:08:56,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:56,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:56,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:56,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:56,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:56,233 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:56,233 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:56,234 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:56,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:56,234 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:08:56,234 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:56,234 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:56,234 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:56,234 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration7_Loop [2018-10-27 06:08:56,234 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:56,234 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:56,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:56,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:56,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:56,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:56,348 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:56,348 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:56,351 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:56,351 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:56,374 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:56,374 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_10=0} Honda state: {v_rep~unnamed0~0~false_10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:56,379 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:56,379 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:56,399 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:56,399 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_10=1} Honda state: {v_rep~unnamed0~0~true_10=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:56,403 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:56,403 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:56,407 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:56,407 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=-2} Honda state: {ULTIMATE.start_main_~up~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:56,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:56,428 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:56,465 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:08:56,465 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:56,576 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:08:56,577 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:56,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:56,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:56,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:56,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:56,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:56,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:56,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:56,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration7_Loop [2018-10-27 06:08:56,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:56,578 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:56,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:56,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:56,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:56,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:56,670 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:56,670 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:56,670 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-10-27 06:08:56,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:56,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:56,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:56,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:56,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:56,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:56,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:56,678 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-10-27 06:08:56,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:56,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:56,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:56,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:56,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:56,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:56,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:56,683 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-10-27 06:08:56,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:56,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:56,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:56,683 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:56,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:56,684 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:56,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:56,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:56,685 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-10-27 06:08:56,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:56,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:56,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:56,686 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:56,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:56,686 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:56,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:56,689 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:56,691 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:56,691 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:56,691 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:56,691 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:08:56,691 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:56,691 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:08:56,692 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:08:56,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:56,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:56,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:56,804 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:08:56,805 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 155 states and 204 transitions. cyclomatic complexity: 64 Second operand 5 states. [2018-10-27 06:08:56,831 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 155 states and 204 transitions. cyclomatic complexity: 64. Second operand 5 states. Result 236 states and 310 transitions. Complement of second has 7 states. [2018-10-27 06:08:56,833 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-10-27 06:08:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:08:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-10-27 06:08:56,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 5 letters. [2018-10-27 06:08:56,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:56,833 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:56,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:56,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:56,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:56,866 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:08:56,866 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 155 states and 204 transitions. cyclomatic complexity: 64 Second operand 5 states. [2018-10-27 06:08:56,904 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 155 states and 204 transitions. cyclomatic complexity: 64. Second operand 5 states. Result 308 states and 388 transitions. Complement of second has 9 states. [2018-10-27 06:08:56,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:08:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-10-27 06:08:56,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 15 letters. Loop has 5 letters. [2018-10-27 06:08:56,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:56,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 20 letters. Loop has 5 letters. [2018-10-27 06:08:56,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:56,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 15 letters. Loop has 10 letters. [2018-10-27 06:08:56,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:56,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 388 transitions. [2018-10-27 06:08:56,908 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2018-10-27 06:08:56,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 298 states and 378 transitions. [2018-10-27 06:08:56,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2018-10-27 06:08:56,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-10-27 06:08:56,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 378 transitions. [2018-10-27 06:08:56,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:56,910 INFO L705 BuchiCegarLoop]: Abstraction has 298 states and 378 transitions. [2018-10-27 06:08:56,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 378 transitions. [2018-10-27 06:08:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 252. [2018-10-27 06:08:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-27 06:08:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 329 transitions. [2018-10-27 06:08:56,917 INFO L728 BuchiCegarLoop]: Abstraction has 252 states and 329 transitions. [2018-10-27 06:08:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:08:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:08:56,917 INFO L87 Difference]: Start difference. First operand 252 states and 329 transitions. Second operand 4 states. [2018-10-27 06:08:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:56,944 INFO L93 Difference]: Finished difference Result 287 states and 369 transitions. [2018-10-27 06:08:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:56,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 369 transitions. [2018-10-27 06:08:56,947 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 70 [2018-10-27 06:08:56,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 277 states and 357 transitions. [2018-10-27 06:08:56,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2018-10-27 06:08:56,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2018-10-27 06:08:56,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 277 states and 357 transitions. [2018-10-27 06:08:56,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:56,951 INFO L705 BuchiCegarLoop]: Abstraction has 277 states and 357 transitions. [2018-10-27 06:08:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states and 357 transitions. [2018-10-27 06:08:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 266. [2018-10-27 06:08:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-27 06:08:56,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 341 transitions. [2018-10-27 06:08:56,960 INFO L728 BuchiCegarLoop]: Abstraction has 266 states and 341 transitions. [2018-10-27 06:08:56,960 INFO L608 BuchiCegarLoop]: Abstraction has 266 states and 341 transitions. [2018-10-27 06:08:56,960 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:08:56,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 341 transitions. [2018-10-27 06:08:56,961 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 68 [2018-10-27 06:08:56,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:56,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:56,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2018-10-27 06:08:56,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2018-10-27 06:08:56,962 INFO L793 eck$LassoCheckResult]: Stem: 3347#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3338#L18-1 assume true; 3496#L11-1 assume !!(main_~i~0 > 0); 3495#L12 assume main_~i~0 == 1;main_~up~0 := 1; 3494#L12-2 assume !(main_~i~0 == 10); 3493#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 3491#L18-1 assume true; 3492#L11-1 assume !!(main_~i~0 > 0); 3538#L12 assume !(main_~i~0 == 1); 3536#L12-2 assume !(main_~i~0 == 10); 3363#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 3348#L18-1 assume true; 3349#L11-1 assume !!(main_~i~0 > 0); 3516#L12 assume main_~i~0 == 1;main_~up~0 := 1; 3499#L12-2 assume !(main_~i~0 == 10); 3440#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 3438#L18-1 [2018-10-27 06:08:56,963 INFO L795 eck$LassoCheckResult]: Loop: 3438#L18-1 assume true; 3437#L11-1 assume !!(main_~i~0 > 0); 3435#L12 assume !(main_~i~0 == 1); 3343#L12-2 assume !(main_~i~0 == 10); 3344#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 3542#L18-1 assume true; 3541#L11-1 assume !!(main_~i~0 > 0); 3473#L12 assume main_~i~0 == 1;main_~up~0 := 1; 3426#L12-2 assume !(main_~i~0 == 10); 3427#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 3438#L18-1 [2018-10-27 06:08:56,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:56,963 INFO L82 PathProgramCache]: Analyzing trace with hash 493458790, now seen corresponding path program 2 times [2018-10-27 06:08:56,963 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:56,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:56,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:56,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:56,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 06:08:57,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:57,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:08:57,015 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:57,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash 441229789, now seen corresponding path program 1 times [2018-10-27 06:08:57,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:57,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:57,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:57,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:57,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:57,125 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:57,126 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:57,126 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:57,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:57,126 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:08:57,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:57,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:57,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:57,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration8_Loop [2018-10-27 06:08:57,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:57,126 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:57,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:57,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:57,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:57,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:57,189 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:57,189 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:57,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:57,196 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:57,225 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:08:57,225 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:57,259 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:08:57,260 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:57,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:57,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:57,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:57,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:57,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:57,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:57,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:57,261 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration8_Loop [2018-10-27 06:08:57,261 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:57,261 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:57,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:57,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:57,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:57,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:57,450 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:57,450 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:57,451 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-10-27 06:08:57,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,452 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:57,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:57,452 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:57,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,455 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-10-27 06:08:57,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:57,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:57,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:57,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,458 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-10-27 06:08:57,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:57,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:57,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,461 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-10-27 06:08:57,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:57,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:57,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:57,465 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,465 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:08:57,465 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-10-27 06:08:57,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,466 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:57,466 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:08:57,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:57,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,471 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-10-27 06:08:57,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,471 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:08:57,473 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:08:57,473 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-10-27 06:08:57,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,477 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-10-27 06:08:57,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,478 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:08:57,478 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:08:57,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,481 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-10-27 06:08:57,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,481 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:08:57,482 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:08:57,482 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-10-27 06:08:57,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,484 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-10-27 06:08:57,485 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-10-27 06:08:57,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,485 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:57,485 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:08:57,486 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:57,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,497 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-10-27 06:08:57,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,498 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:08:57,500 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:08:57,500 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:08:57,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,508 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-10-27 06:08:57,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,509 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:08:57,525 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:57,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,528 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-10-27 06:08:57,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,529 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:08:57,531 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:08:57,531 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:08:57,540 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,540 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-10-27 06:08:57,540 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-10-27 06:08:57,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,541 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:57,541 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:08:57,542 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:08:57,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,556 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-10-27 06:08:57,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,557 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:08:57,558 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-10-27 06:08:57,559 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-10-27 06:08:57,568 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,568 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-10-27 06:08:57,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,569 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:08:57,574 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:08:57,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,578 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-10-27 06:08:57,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:57,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,597 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:08:57,598 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-10-27 06:08:57,598 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-10-27 06:08:57,610 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,610 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-10-27 06:08:57,611 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-10-27 06:08:57,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,611 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:08:57,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,612 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:57,612 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:08:57,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:57,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,628 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-10-27 06:08:57,629 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,629 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:08:57,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,632 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:08:57,633 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:08:57,633 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-10-27 06:08:57,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,639 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-10-27 06:08:57,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,640 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:08:57,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,640 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:08:57,641 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:08:57,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,661 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-10-27 06:08:57,661 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,661 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:08:57,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,662 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:08:57,663 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:08:57,663 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-10-27 06:08:57,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,674 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-10-27 06:08:57,674 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-10-27 06:08:57,674 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,675 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:08:57,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,675 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:57,675 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:08:57,676 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:57,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,696 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,697 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-10-27 06:08:57,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,698 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:08:57,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:08:57,699 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:08:57,700 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:08:57,711 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,713 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-10-27 06:08:57,714 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,714 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:08:57,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,714 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:08:57,715 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:57,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,725 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-10-27 06:08:57,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,734 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:08:57,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,735 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:08:57,736 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:08:57,736 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:08:57,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,742 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-10-27 06:08:57,742 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-10-27 06:08:57,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,743 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:08:57,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,743 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:57,744 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:08:57,752 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:08:57,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,765 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-10-27 06:08:57,766 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,766 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:08:57,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,766 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:08:57,768 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-10-27 06:08:57,768 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-10-27 06:08:57,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,779 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-10-27 06:08:57,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,780 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:08:57,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,780 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:08:57,786 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:08:57,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,795 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-10-27 06:08:57,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,795 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:08:57,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,796 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:08:57,802 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-10-27 06:08:57,802 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-10-27 06:08:57,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,808 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-10-27 06:08:57,809 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-10-27 06:08:57,809 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,812 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:08:57,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,812 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:57,812 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:08:57,816 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:57,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,821 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-10-27 06:08:57,823 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,823 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:08:57,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,823 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:08:57,824 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:08:57,824 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:08:57,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,828 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-10-27 06:08:57,829 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,829 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:08:57,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,838 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:08:57,839 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:57,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,844 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-10-27 06:08:57,844 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,844 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:08:57,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,844 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:08:57,852 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:08:57,852 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:08:57,855 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,855 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-10-27 06:08:57,856 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-10-27 06:08:57,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,856 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:08:57,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,856 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:57,856 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:08:57,865 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:08:57,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,881 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-10-27 06:08:57,881 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,884 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:08:57,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,884 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:08:57,886 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-10-27 06:08:57,886 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-10-27 06:08:57,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,894 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-10-27 06:08:57,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,895 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:08:57,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:57,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,895 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:08:57,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:57,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:57,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:57,913 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:08:57,916 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:08:57,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:57,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:57,917 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:08:57,918 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-10-27 06:08:57,918 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-10-27 06:08:57,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:57,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:57,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:57,927 INFO L87 Difference]: Start difference. First operand 266 states and 341 transitions. cyclomatic complexity: 99 Second operand 3 states. [2018-10-27 06:08:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:57,954 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2018-10-27 06:08:57,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:57,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 174 transitions. [2018-10-27 06:08:57,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:08:57,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 107 states and 122 transitions. [2018-10-27 06:08:57,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-10-27 06:08:57,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-10-27 06:08:57,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 122 transitions. [2018-10-27 06:08:57,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:57,957 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 122 transitions. [2018-10-27 06:08:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 122 transitions. [2018-10-27 06:08:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2018-10-27 06:08:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-27 06:08:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2018-10-27 06:08:57,959 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 111 transitions. [2018-10-27 06:08:57,959 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 111 transitions. [2018-10-27 06:08:57,959 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:08:57,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 111 transitions. [2018-10-27 06:08:57,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:08:57,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:57,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:57,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2018-10-27 06:08:57,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 2, 2, 1, 1] [2018-10-27 06:08:57,961 INFO L793 eck$LassoCheckResult]: Stem: 3779#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3768#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3769#L18-1 assume true; 3824#L11-1 assume !!(main_~i~0 > 0); 3854#L12 assume main_~i~0 == 1;main_~up~0 := 1; 3853#L12-2 assume !(main_~i~0 == 10); 3852#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 3851#L18-1 assume true; 3847#L11-1 assume !!(main_~i~0 > 0); 3850#L12 assume !(main_~i~0 == 1); 3849#L12-2 assume !(main_~i~0 == 10); 3848#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 3846#L18-1 assume true; 3845#L11-1 assume !!(main_~i~0 > 0); 3844#L12 assume !(main_~i~0 == 1); 3843#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 3789#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 3782#L18-1 assume true; 3772#L11-1 assume !!(main_~i~0 > 0); 3773#L12 assume !(main_~i~0 == 1); 3783#L12-2 assume !(main_~i~0 == 10); 3839#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 3838#L18-1 assume true; 3770#L11-1 assume !!(main_~i~0 > 0); 3771#L12 assume main_~i~0 == 1;main_~up~0 := 1; 3774#L12-2 [2018-10-27 06:08:57,969 INFO L795 eck$LassoCheckResult]: Loop: 3774#L12-2 assume !(main_~i~0 == 10); 3775#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 3780#L18-1 assume true; 3781#L11-1 assume !!(main_~i~0 > 0); 3858#L12 assume !(main_~i~0 == 1); 3856#L12-2 assume !(main_~i~0 == 10); 3837#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 3835#L18-1 assume true; 3836#L11-1 assume !!(main_~i~0 > 0); 3857#L12 assume !(main_~i~0 == 1); 3855#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 3829#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 3862#L18-1 assume true; 3860#L11-1 assume !!(main_~i~0 > 0); 3831#L12 assume !(main_~i~0 == 1); 3830#L12-2 assume !(main_~i~0 == 10); 3784#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 3785#L18-1 assume true; 3833#L11-1 assume !!(main_~i~0 > 0); 3834#L12 assume main_~i~0 == 1;main_~up~0 := 1; 3774#L12-2 [2018-10-27 06:08:57,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:57,969 INFO L82 PathProgramCache]: Analyzing trace with hash 984758182, now seen corresponding path program 2 times [2018-10-27 06:08:57,969 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:57,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:57,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:57,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:57,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 06:08:58,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:58,003 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:58,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:58,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:58,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:58,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 06:08:58,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:58,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-27 06:08:58,046 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:58,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:58,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2062941503, now seen corresponding path program 1 times [2018-10-27 06:08:58,047 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:58,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:58,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:58,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:58,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:08:58,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:58,070 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:58,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:58,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:08:58,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:58,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-27 06:08:58,109 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:58,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:08:58,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:08:58,109 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. cyclomatic complexity: 23 Second operand 5 states. [2018-10-27 06:08:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:58,155 INFO L93 Difference]: Finished difference Result 137 states and 161 transitions. [2018-10-27 06:08:58,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:08:58,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 161 transitions. [2018-10-27 06:08:58,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-10-27 06:08:58,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 131 states and 155 transitions. [2018-10-27 06:08:58,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-10-27 06:08:58,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2018-10-27 06:08:58,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 155 transitions. [2018-10-27 06:08:58,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:58,158 INFO L705 BuchiCegarLoop]: Abstraction has 131 states and 155 transitions. [2018-10-27 06:08:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 155 transitions. [2018-10-27 06:08:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2018-10-27 06:08:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-27 06:08:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2018-10-27 06:08:58,160 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-10-27 06:08:58,160 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-10-27 06:08:58,160 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:08:58,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 135 transitions. [2018-10-27 06:08:58,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-10-27 06:08:58,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:58,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:58,164 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 3, 2, 2, 1, 1, 1] [2018-10-27 06:08:58,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 3, 2, 1, 1] [2018-10-27 06:08:58,164 INFO L793 eck$LassoCheckResult]: Stem: 4152#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 4142#L18-1 assume true; 4233#L11-1 assume !!(main_~i~0 > 0); 4203#L12 assume main_~i~0 == 1;main_~up~0 := 1; 4204#L12-2 assume !(main_~i~0 == 10); 4230#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 4229#L18-1 assume true; 4219#L11-1 assume !!(main_~i~0 > 0); 4226#L12 assume !(main_~i~0 == 1); 4224#L12-2 assume !(main_~i~0 == 10); 4221#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 4218#L18-1 assume true; 4217#L11-1 assume !!(main_~i~0 > 0); 4216#L12 assume !(main_~i~0 == 1); 4147#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 4148#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4155#L18-1 assume true; 4145#L11-1 assume !!(main_~i~0 > 0); 4146#L12 assume !(main_~i~0 == 1); 4254#L12-2 assume !(main_~i~0 == 10); 4253#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4252#L18-1 assume true; 4238#L11-1 assume !!(main_~i~0 > 0); 4251#L12 assume !(main_~i~0 == 1); 4249#L12-2 assume !(main_~i~0 == 10); 4239#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4237#L18-1 assume true; 4202#L11-1 assume !!(main_~i~0 > 0); 4190#L12 assume main_~i~0 == 1;main_~up~0 := 1; 4188#L12-2 [2018-10-27 06:08:58,165 INFO L795 eck$LassoCheckResult]: Loop: 4188#L12-2 assume !(main_~i~0 == 10); 4187#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 4185#L18-1 assume true; 4183#L11-1 assume !!(main_~i~0 > 0); 4181#L12 assume !(main_~i~0 == 1); 4178#L12-2 assume !(main_~i~0 == 10); 4166#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 4173#L18-1 assume true; 4172#L11-1 assume !!(main_~i~0 > 0); 4171#L12 assume !(main_~i~0 == 1); 4164#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 4165#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4153#L18-1 assume true; 4154#L11-1 assume !!(main_~i~0 > 0); 4243#L12 assume !(main_~i~0 == 1); 4242#L12-2 assume !(main_~i~0 == 10); 4240#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4241#L18-1 assume true; 4143#L11-1 assume !!(main_~i~0 > 0); 4144#L12 assume !(main_~i~0 == 1); 4156#L12-2 assume !(main_~i~0 == 10); 4161#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4162#L18-1 assume true; 4236#L11-1 assume !!(main_~i~0 > 0); 4244#L12 assume main_~i~0 == 1;main_~up~0 := 1; 4188#L12-2 [2018-10-27 06:08:58,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:58,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1625836357, now seen corresponding path program 3 times [2018-10-27 06:08:58,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:58,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:58,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:58,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:58,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 06:08:58,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:58,435 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:58,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:08:58,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 06:08:58,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:58,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 06:08:58,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:58,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-27 06:08:58,901 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:58,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash -923164032, now seen corresponding path program 2 times [2018-10-27 06:08:58,901 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:58,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:58,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:08:58,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:58,970 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:58,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:58,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:58,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:58,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:08:59,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:59,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-27 06:08:59,015 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:59,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:08:59,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:08:59,016 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. cyclomatic complexity: 27 Second operand 6 states. [2018-10-27 06:08:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:59,112 INFO L93 Difference]: Finished difference Result 157 states and 185 transitions. [2018-10-27 06:08:59,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:08:59,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 185 transitions. [2018-10-27 06:08:59,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2018-10-27 06:08:59,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 151 states and 179 transitions. [2018-10-27 06:08:59,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-10-27 06:08:59,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-10-27 06:08:59,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 179 transitions. [2018-10-27 06:08:59,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:59,116 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 179 transitions. [2018-10-27 06:08:59,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 179 transitions. [2018-10-27 06:08:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 136. [2018-10-27 06:08:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-27 06:08:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2018-10-27 06:08:59,123 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 159 transitions. [2018-10-27 06:08:59,123 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 159 transitions. [2018-10-27 06:08:59,123 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:08:59,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 159 transitions. [2018-10-27 06:08:59,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-10-27 06:08:59,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:59,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:59,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 5, 5, 4, 2, 2, 1, 1, 1] [2018-10-27 06:08:59,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 4, 2, 1, 1] [2018-10-27 06:08:59,128 INFO L793 eck$LassoCheckResult]: Stem: 4600#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 4590#L18-1 assume true; 4663#L11-1 assume !!(main_~i~0 > 0); 4667#L12 assume main_~i~0 == 1;main_~up~0 := 1; 4666#L12-2 assume !(main_~i~0 == 10); 4665#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 4664#L18-1 assume true; 4654#L11-1 assume !!(main_~i~0 > 0); 4661#L12 assume !(main_~i~0 == 1); 4659#L12-2 assume !(main_~i~0 == 10); 4657#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 4653#L18-1 assume true; 4651#L11-1 assume !!(main_~i~0 > 0); 4649#L12 assume !(main_~i~0 == 1); 4647#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 4606#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4607#L18-1 assume true; 4720#L11-1 assume !!(main_~i~0 > 0); 4719#L12 assume !(main_~i~0 == 1); 4718#L12-2 assume !(main_~i~0 == 10); 4717#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4716#L18-1 assume true; 4715#L11-1 assume !!(main_~i~0 > 0); 4714#L12 assume !(main_~i~0 == 1); 4713#L12-2 assume !(main_~i~0 == 10); 4712#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4711#L18-1 assume true; 4680#L11-1 assume !!(main_~i~0 > 0); 4710#L12 assume !(main_~i~0 == 1); 4685#L12-2 assume !(main_~i~0 == 10); 4682#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4679#L18-1 assume true; 4675#L11-1 assume !!(main_~i~0 > 0); 4616#L12 assume main_~i~0 == 1;main_~up~0 := 1; 4610#L12-2 [2018-10-27 06:08:59,128 INFO L795 eck$LassoCheckResult]: Loop: 4610#L12-2 assume !(main_~i~0 == 10); 4611#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 4669#L18-1 assume true; 4668#L11-1 assume !!(main_~i~0 > 0); 4612#L12 assume !(main_~i~0 == 1); 4613#L12-2 assume !(main_~i~0 == 10); 4700#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 4705#L18-1 assume true; 4703#L11-1 assume !!(main_~i~0 > 0); 4701#L12 assume !(main_~i~0 == 1); 4699#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 4596#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4609#L18-1 assume true; 4591#L11-1 assume !!(main_~i~0 > 0); 4592#L12 assume !(main_~i~0 == 1); 4698#L12-2 assume !(main_~i~0 == 10); 4697#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4696#L18-1 assume true; 4695#L11-1 assume !!(main_~i~0 > 0); 4694#L12 assume !(main_~i~0 == 1); 4693#L12-2 assume !(main_~i~0 == 10); 4692#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4691#L18-1 assume true; 4690#L11-1 assume !!(main_~i~0 > 0); 4688#L12 assume !(main_~i~0 == 1); 4684#L12-2 assume !(main_~i~0 == 10); 4681#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 4677#L18-1 assume true; 4678#L11-1 assume !!(main_~i~0 > 0); 4689#L12 assume main_~i~0 == 1;main_~up~0 := 1; 4610#L12-2 [2018-10-27 06:08:59,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:59,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1553064762, now seen corresponding path program 4 times [2018-10-27 06:08:59,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:59,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:59,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:59,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:59,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 59 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 06:08:59,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:59,226 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:59,245 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:08:59,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:08:59,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:59,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 59 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 06:08:59,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:59,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-27 06:08:59,291 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:59,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:59,291 INFO L82 PathProgramCache]: Analyzing trace with hash 987955745, now seen corresponding path program 3 times [2018-10-27 06:08:59,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:59,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:59,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:59,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:59,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 41 proven. 27 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:08:59,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:59,364 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:59,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:08:59,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-27 06:08:59,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:59,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:59,386 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 41 proven. 27 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:08:59,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:59,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-27 06:08:59,406 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:59,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:08:59,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:08:59,406 INFO L87 Difference]: Start difference. First operand 136 states and 159 transitions. cyclomatic complexity: 31 Second operand 7 states. [2018-10-27 06:08:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:59,444 INFO L93 Difference]: Finished difference Result 177 states and 209 transitions. [2018-10-27 06:08:59,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:08:59,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 209 transitions. [2018-10-27 06:08:59,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-10-27 06:08:59,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 171 states and 203 transitions. [2018-10-27 06:08:59,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-10-27 06:08:59,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-10-27 06:08:59,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 203 transitions. [2018-10-27 06:08:59,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:59,447 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 203 transitions. [2018-10-27 06:08:59,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 203 transitions. [2018-10-27 06:08:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 156. [2018-10-27 06:08:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-27 06:08:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2018-10-27 06:08:59,449 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 183 transitions. [2018-10-27 06:08:59,449 INFO L608 BuchiCegarLoop]: Abstraction has 156 states and 183 transitions. [2018-10-27 06:08:59,450 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:08:59,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 183 transitions. [2018-10-27 06:08:59,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-10-27 06:08:59,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:59,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:59,451 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 6, 6, 5, 2, 2, 1, 1, 1] [2018-10-27 06:08:59,451 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 5, 2, 1, 1] [2018-10-27 06:08:59,452 INFO L793 eck$LassoCheckResult]: Stem: 5115#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5104#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5105#L18-1 assume true; 5181#L11-1 assume !!(main_~i~0 > 0); 5186#L12 assume main_~i~0 == 1;main_~up~0 := 1; 5185#L12-2 assume !(main_~i~0 == 10); 5184#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 5183#L18-1 assume true; 5173#L11-1 assume !!(main_~i~0 > 0); 5180#L12 assume !(main_~i~0 == 1); 5178#L12-2 assume !(main_~i~0 == 10); 5176#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 5172#L18-1 assume true; 5170#L11-1 assume !!(main_~i~0 > 0); 5168#L12 assume !(main_~i~0 == 1); 5166#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 5120#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5121#L18-1 assume true; 5243#L11-1 assume !!(main_~i~0 > 0); 5242#L12 assume !(main_~i~0 == 1); 5241#L12-2 assume !(main_~i~0 == 10); 5240#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5239#L18-1 assume true; 5238#L11-1 assume !!(main_~i~0 > 0); 5237#L12 assume !(main_~i~0 == 1); 5236#L12-2 assume !(main_~i~0 == 10); 5235#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5234#L18-1 assume true; 5233#L11-1 assume !!(main_~i~0 > 0); 5232#L12 assume !(main_~i~0 == 1); 5231#L12-2 assume !(main_~i~0 == 10); 5230#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5228#L18-1 assume true; 5199#L11-1 assume !!(main_~i~0 > 0); 5209#L12 assume !(main_~i~0 == 1); 5205#L12-2 assume !(main_~i~0 == 10); 5202#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5198#L18-1 assume true; 5196#L11-1 assume !!(main_~i~0 > 0); 5130#L12 assume main_~i~0 == 1;main_~up~0 := 1; 5124#L12-2 [2018-10-27 06:08:59,452 INFO L795 eck$LassoCheckResult]: Loop: 5124#L12-2 assume !(main_~i~0 == 10); 5125#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 5249#L18-1 assume true; 5248#L11-1 assume !!(main_~i~0 > 0); 5126#L12 assume !(main_~i~0 == 1); 5127#L12-2 assume !(main_~i~0 == 10); 5190#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 5189#L18-1 assume true; 5187#L11-1 assume !!(main_~i~0 > 0); 5188#L12 assume !(main_~i~0 == 1); 5245#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 5111#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5123#L18-1 assume true; 5227#L11-1 assume !!(main_~i~0 > 0); 5226#L12 assume !(main_~i~0 == 1); 5225#L12-2 assume !(main_~i~0 == 10); 5224#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5223#L18-1 assume true; 5222#L11-1 assume !!(main_~i~0 > 0); 5221#L12 assume !(main_~i~0 == 1); 5220#L12-2 assume !(main_~i~0 == 10); 5219#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5218#L18-1 assume true; 5217#L11-1 assume !!(main_~i~0 > 0); 5216#L12 assume !(main_~i~0 == 1); 5215#L12-2 assume !(main_~i~0 == 10); 5214#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5213#L18-1 assume true; 5212#L11-1 assume !!(main_~i~0 > 0); 5210#L12 assume !(main_~i~0 == 1); 5207#L12-2 assume !(main_~i~0 == 10); 5203#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5200#L18-1 assume true; 5201#L11-1 assume !!(main_~i~0 > 0); 5211#L12 assume main_~i~0 == 1;main_~up~0 := 1; 5124#L12-2 [2018-10-27 06:08:59,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:59,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1872626587, now seen corresponding path program 5 times [2018-10-27 06:08:59,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:59,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:59,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:59,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:59,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:59,507 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-27 06:08:59,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:59,507 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:59,515 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:08:59,551 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-27 06:08:59,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:59,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-27 06:08:59,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:59,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-27 06:08:59,586 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:59,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:59,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1044824288, now seen corresponding path program 4 times [2018-10-27 06:08:59,586 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:59,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:59,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:59,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:59,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 52 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:08:59,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:59,918 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:59,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:08:59,932 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:08:59,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:59,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 52 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:08:59,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:59,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-27 06:08:59,959 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:59,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:08:59,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:08:59,959 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. cyclomatic complexity: 35 Second operand 8 states. [2018-10-27 06:09:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:00,068 INFO L93 Difference]: Finished difference Result 197 states and 233 transitions. [2018-10-27 06:09:00,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:09:00,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 233 transitions. [2018-10-27 06:09:00,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2018-10-27 06:09:00,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 191 states and 227 transitions. [2018-10-27 06:09:00,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2018-10-27 06:09:00,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2018-10-27 06:09:00,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 191 states and 227 transitions. [2018-10-27 06:09:00,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:00,073 INFO L705 BuchiCegarLoop]: Abstraction has 191 states and 227 transitions. [2018-10-27 06:09:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states and 227 transitions. [2018-10-27 06:09:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2018-10-27 06:09:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-27 06:09:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 207 transitions. [2018-10-27 06:09:00,076 INFO L728 BuchiCegarLoop]: Abstraction has 176 states and 207 transitions. [2018-10-27 06:09:00,076 INFO L608 BuchiCegarLoop]: Abstraction has 176 states and 207 transitions. [2018-10-27 06:09:00,076 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:09:00,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 207 transitions. [2018-10-27 06:09:00,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-10-27 06:09:00,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:00,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:00,082 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 7, 7, 6, 2, 2, 1, 1, 1] [2018-10-27 06:09:00,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 7, 7, 6, 2, 1, 1] [2018-10-27 06:09:00,082 INFO L793 eck$LassoCheckResult]: Stem: 5701#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5691#L18-1 assume true; 5773#L11-1 assume !!(main_~i~0 > 0); 5777#L12 assume main_~i~0 == 1;main_~up~0 := 1; 5776#L12-2 assume !(main_~i~0 == 10); 5775#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 5774#L18-1 assume true; 5764#L11-1 assume !!(main_~i~0 > 0); 5771#L12 assume !(main_~i~0 == 1); 5769#L12-2 assume !(main_~i~0 == 10); 5767#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 5763#L18-1 assume true; 5761#L11-1 assume !!(main_~i~0 > 0); 5759#L12 assume !(main_~i~0 == 1); 5757#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 5706#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5707#L18-1 assume true; 5852#L11-1 assume !!(main_~i~0 > 0); 5851#L12 assume !(main_~i~0 == 1); 5850#L12-2 assume !(main_~i~0 == 10); 5849#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5848#L18-1 assume true; 5847#L11-1 assume !!(main_~i~0 > 0); 5846#L12 assume !(main_~i~0 == 1); 5845#L12-2 assume !(main_~i~0 == 10); 5844#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5843#L18-1 assume true; 5842#L11-1 assume !!(main_~i~0 > 0); 5841#L12 assume !(main_~i~0 == 1); 5840#L12-2 assume !(main_~i~0 == 10); 5839#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5838#L18-1 assume true; 5837#L11-1 assume !!(main_~i~0 > 0); 5836#L12 assume !(main_~i~0 == 1); 5835#L12-2 assume !(main_~i~0 == 10); 5834#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5826#L18-1 assume true; 5793#L11-1 assume !!(main_~i~0 > 0); 5825#L12 assume !(main_~i~0 == 1); 5798#L12-2 assume !(main_~i~0 == 10); 5795#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5792#L18-1 assume true; 5787#L11-1 assume !!(main_~i~0 > 0); 5714#L12 assume main_~i~0 == 1;main_~up~0 := 1; 5710#L12-2 [2018-10-27 06:09:00,083 INFO L795 eck$LassoCheckResult]: Loop: 5710#L12-2 assume !(main_~i~0 == 10); 5711#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 5780#L18-1 assume true; 5781#L11-1 assume !!(main_~i~0 > 0); 5712#L12 assume !(main_~i~0 == 1); 5713#L12-2 assume !(main_~i~0 == 10); 5828#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 5832#L18-1 assume true; 5778#L11-1 assume !!(main_~i~0 > 0); 5779#L12 assume !(main_~i~0 == 1); 5827#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 5697#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5709#L18-1 assume true; 5823#L11-1 assume !!(main_~i~0 > 0); 5822#L12 assume !(main_~i~0 == 1); 5821#L12-2 assume !(main_~i~0 == 10); 5820#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5819#L18-1 assume true; 5818#L11-1 assume !!(main_~i~0 > 0); 5817#L12 assume !(main_~i~0 == 1); 5816#L12-2 assume !(main_~i~0 == 10); 5815#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5814#L18-1 assume true; 5813#L11-1 assume !!(main_~i~0 > 0); 5812#L12 assume !(main_~i~0 == 1); 5811#L12-2 assume !(main_~i~0 == 10); 5810#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5809#L18-1 assume true; 5808#L11-1 assume !!(main_~i~0 > 0); 5807#L12 assume !(main_~i~0 == 1); 5806#L12-2 assume !(main_~i~0 == 10); 5805#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5804#L18-1 assume true; 5803#L11-1 assume !!(main_~i~0 > 0); 5801#L12 assume !(main_~i~0 == 1); 5797#L12-2 assume !(main_~i~0 == 10); 5794#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 5790#L18-1 assume true; 5791#L11-1 assume !!(main_~i~0 > 0); 5802#L12 assume main_~i~0 == 1;main_~up~0 := 1; 5710#L12-2 [2018-10-27 06:09:00,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash -823780890, now seen corresponding path program 6 times [2018-10-27 06:09:00,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:00,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:00,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:00,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:00,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 87 proven. 7 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-27 06:09:00,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:00,132 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:00,145 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:09:00,157 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-27 06:09:00,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:00,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 87 proven. 7 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-27 06:09:00,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:00,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-27 06:09:00,198 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:00,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:00,198 INFO L82 PathProgramCache]: Analyzing trace with hash 646728065, now seen corresponding path program 5 times [2018-10-27 06:09:00,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:00,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:00,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:00,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:00,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 63 proven. 70 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:09:00,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:00,280 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:00,287 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:09:00,296 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-27 06:09:00,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:00,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 63 proven. 70 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:09:00,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:00,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-27 06:09:00,326 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:00,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:09:00,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:09:00,326 INFO L87 Difference]: Start difference. First operand 176 states and 207 transitions. cyclomatic complexity: 39 Second operand 9 states. [2018-10-27 06:09:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:00,542 INFO L93 Difference]: Finished difference Result 217 states and 257 transitions. [2018-10-27 06:09:00,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:09:00,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 257 transitions. [2018-10-27 06:09:00,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-10-27 06:09:00,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 211 states and 251 transitions. [2018-10-27 06:09:00,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2018-10-27 06:09:00,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2018-10-27 06:09:00,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 211 states and 251 transitions. [2018-10-27 06:09:00,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:00,545 INFO L705 BuchiCegarLoop]: Abstraction has 211 states and 251 transitions. [2018-10-27 06:09:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 251 transitions. [2018-10-27 06:09:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 196. [2018-10-27 06:09:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-27 06:09:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 231 transitions. [2018-10-27 06:09:00,548 INFO L728 BuchiCegarLoop]: Abstraction has 196 states and 231 transitions. [2018-10-27 06:09:00,548 INFO L608 BuchiCegarLoop]: Abstraction has 196 states and 231 transitions. [2018-10-27 06:09:00,548 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-10-27 06:09:00,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 231 transitions. [2018-10-27 06:09:00,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-10-27 06:09:00,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:00,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:00,550 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 7, 2, 2, 1, 1, 1] [2018-10-27 06:09:00,550 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 8, 8, 7, 2, 1, 1] [2018-10-27 06:09:00,550 INFO L793 eck$LassoCheckResult]: Stem: 6358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6347#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 6348#L18-1 assume true; 6435#L11-1 assume !!(main_~i~0 > 0); 6439#L12 assume main_~i~0 == 1;main_~up~0 := 1; 6438#L12-2 assume !(main_~i~0 == 10); 6437#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 6436#L18-1 assume true; 6426#L11-1 assume !!(main_~i~0 > 0); 6433#L12 assume !(main_~i~0 == 1); 6431#L12-2 assume !(main_~i~0 == 10); 6429#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 6425#L18-1 assume true; 6423#L11-1 assume !!(main_~i~0 > 0); 6421#L12 assume !(main_~i~0 == 1); 6419#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 6363#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6364#L18-1 assume true; 6524#L11-1 assume !!(main_~i~0 > 0); 6523#L12 assume !(main_~i~0 == 1); 6522#L12-2 assume !(main_~i~0 == 10); 6521#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6520#L18-1 assume true; 6519#L11-1 assume !!(main_~i~0 > 0); 6518#L12 assume !(main_~i~0 == 1); 6517#L12-2 assume !(main_~i~0 == 10); 6516#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6515#L18-1 assume true; 6514#L11-1 assume !!(main_~i~0 > 0); 6513#L12 assume !(main_~i~0 == 1); 6512#L12-2 assume !(main_~i~0 == 10); 6511#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6510#L18-1 assume true; 6509#L11-1 assume !!(main_~i~0 > 0); 6508#L12 assume !(main_~i~0 == 1); 6507#L12-2 assume !(main_~i~0 == 10); 6506#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6505#L18-1 assume true; 6504#L11-1 assume !!(main_~i~0 > 0); 6503#L12 assume !(main_~i~0 == 1); 6502#L12-2 assume !(main_~i~0 == 10); 6501#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6493#L18-1 assume true; 6455#L11-1 assume !!(main_~i~0 > 0); 6492#L12 assume !(main_~i~0 == 1); 6460#L12-2 assume !(main_~i~0 == 10); 6457#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6454#L18-1 assume true; 6449#L11-1 assume !!(main_~i~0 > 0); 6371#L12 assume main_~i~0 == 1;main_~up~0 := 1; 6367#L12-2 [2018-10-27 06:09:00,551 INFO L795 eck$LassoCheckResult]: Loop: 6367#L12-2 assume !(main_~i~0 == 10); 6368#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 6442#L18-1 assume true; 6443#L11-1 assume !!(main_~i~0 > 0); 6369#L12 assume !(main_~i~0 == 1); 6370#L12-2 assume !(main_~i~0 == 10); 6495#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 6499#L18-1 assume true; 6440#L11-1 assume !!(main_~i~0 > 0); 6441#L12 assume !(main_~i~0 == 1); 6494#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 6354#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6366#L18-1 assume true; 6490#L11-1 assume !!(main_~i~0 > 0); 6489#L12 assume !(main_~i~0 == 1); 6488#L12-2 assume !(main_~i~0 == 10); 6487#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6486#L18-1 assume true; 6485#L11-1 assume !!(main_~i~0 > 0); 6484#L12 assume !(main_~i~0 == 1); 6483#L12-2 assume !(main_~i~0 == 10); 6482#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6481#L18-1 assume true; 6480#L11-1 assume !!(main_~i~0 > 0); 6479#L12 assume !(main_~i~0 == 1); 6478#L12-2 assume !(main_~i~0 == 10); 6477#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6476#L18-1 assume true; 6475#L11-1 assume !!(main_~i~0 > 0); 6474#L12 assume !(main_~i~0 == 1); 6473#L12-2 assume !(main_~i~0 == 10); 6472#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6471#L18-1 assume true; 6470#L11-1 assume !!(main_~i~0 > 0); 6469#L12 assume !(main_~i~0 == 1); 6468#L12-2 assume !(main_~i~0 == 10); 6467#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6466#L18-1 assume true; 6465#L11-1 assume !!(main_~i~0 > 0); 6463#L12 assume !(main_~i~0 == 1); 6459#L12-2 assume !(main_~i~0 == 10); 6456#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 6452#L18-1 assume true; 6453#L11-1 assume !!(main_~i~0 > 0); 6464#L12 assume main_~i~0 == 1;main_~up~0 := 1; 6367#L12-2 [2018-10-27 06:09:00,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:00,551 INFO L82 PathProgramCache]: Analyzing trace with hash -952681861, now seen corresponding path program 7 times [2018-10-27 06:09:00,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:00,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:00,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:00,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:00,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 101 proven. 7 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-27 06:09:00,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:00,611 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 101 proven. 7 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-27 06:09:00,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:00,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-27 06:09:00,662 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:00,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:00,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2087349312, now seen corresponding path program 6 times [2018-10-27 06:09:00,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:00,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:00,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:00,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:00,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 74 proven. 99 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:09:00,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:00,731 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:00,744 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:09:00,755 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-27 06:09:00,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:00,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 74 proven. 99 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:09:00,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:00,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-27 06:09:00,785 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:00,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:09:00,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:09:00,785 INFO L87 Difference]: Start difference. First operand 196 states and 231 transitions. cyclomatic complexity: 43 Second operand 10 states. [2018-10-27 06:09:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:00,870 INFO L93 Difference]: Finished difference Result 237 states and 281 transitions. [2018-10-27 06:09:00,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:09:00,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 237 states and 281 transitions. [2018-10-27 06:09:00,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-10-27 06:09:00,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 237 states to 231 states and 275 transitions. [2018-10-27 06:09:00,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-10-27 06:09:00,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-10-27 06:09:00,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 275 transitions. [2018-10-27 06:09:00,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:00,873 INFO L705 BuchiCegarLoop]: Abstraction has 231 states and 275 transitions. [2018-10-27 06:09:00,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 275 transitions. [2018-10-27 06:09:00,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 216. [2018-10-27 06:09:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-27 06:09:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 255 transitions. [2018-10-27 06:09:00,877 INFO L728 BuchiCegarLoop]: Abstraction has 216 states and 255 transitions. [2018-10-27 06:09:00,877 INFO L608 BuchiCegarLoop]: Abstraction has 216 states and 255 transitions. [2018-10-27 06:09:00,877 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-10-27 06:09:00,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 216 states and 255 transitions. [2018-10-27 06:09:00,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2018-10-27 06:09:00,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:00,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:00,879 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 9, 9, 8, 2, 2, 1, 1, 1] [2018-10-27 06:09:00,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 9, 9, 8, 2, 1, 1] [2018-10-27 06:09:00,879 INFO L793 eck$LassoCheckResult]: Stem: 7086#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7075#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 7076#L18-1 assume true; 7167#L11-1 assume !!(main_~i~0 > 0); 7171#L12 assume main_~i~0 == 1;main_~up~0 := 1; 7170#L12-2 assume !(main_~i~0 == 10); 7169#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 7168#L18-1 assume true; 7158#L11-1 assume !!(main_~i~0 > 0); 7165#L12 assume !(main_~i~0 == 1); 7163#L12-2 assume !(main_~i~0 == 10); 7161#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 7157#L18-1 assume true; 7155#L11-1 assume !!(main_~i~0 > 0); 7153#L12 assume !(main_~i~0 == 1); 7151#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 7090#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7091#L18-1 assume true; 7259#L11-1 assume !!(main_~i~0 > 0); 7258#L12 assume !(main_~i~0 == 1); 7257#L12-2 assume !(main_~i~0 == 10); 7256#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7255#L18-1 assume true; 7254#L11-1 assume !!(main_~i~0 > 0); 7253#L12 assume !(main_~i~0 == 1); 7252#L12-2 assume !(main_~i~0 == 10); 7251#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7250#L18-1 assume true; 7249#L11-1 assume !!(main_~i~0 > 0); 7248#L12 assume !(main_~i~0 == 1); 7247#L12-2 assume !(main_~i~0 == 10); 7246#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7245#L18-1 assume true; 7244#L11-1 assume !!(main_~i~0 > 0); 7243#L12 assume !(main_~i~0 == 1); 7242#L12-2 assume !(main_~i~0 == 10); 7241#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7240#L18-1 assume true; 7239#L11-1 assume !!(main_~i~0 > 0); 7238#L12 assume !(main_~i~0 == 1); 7237#L12-2 assume !(main_~i~0 == 10); 7236#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7235#L18-1 assume true; 7234#L11-1 assume !!(main_~i~0 > 0); 7233#L12 assume !(main_~i~0 == 1); 7232#L12-2 assume !(main_~i~0 == 10); 7231#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7229#L18-1 assume true; 7187#L11-1 assume !!(main_~i~0 > 0); 7196#L12 assume !(main_~i~0 == 1); 7192#L12-2 assume !(main_~i~0 == 10); 7189#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7185#L18-1 assume true; 7186#L11-1 assume !!(main_~i~0 > 0); 7098#L12 assume main_~i~0 == 1;main_~up~0 := 1; 7094#L12-2 [2018-10-27 06:09:00,879 INFO L795 eck$LassoCheckResult]: Loop: 7094#L12-2 assume !(main_~i~0 == 10); 7095#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 7265#L18-1 assume true; 7264#L11-1 assume !!(main_~i~0 > 0); 7096#L12 assume !(main_~i~0 == 1); 7097#L12-2 assume !(main_~i~0 == 10); 7175#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 7174#L18-1 assume true; 7172#L11-1 assume !!(main_~i~0 > 0); 7173#L12 assume !(main_~i~0 == 1); 7261#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 7082#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7093#L18-1 assume true; 7228#L11-1 assume !!(main_~i~0 > 0); 7227#L12 assume !(main_~i~0 == 1); 7226#L12-2 assume !(main_~i~0 == 10); 7225#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7224#L18-1 assume true; 7223#L11-1 assume !!(main_~i~0 > 0); 7222#L12 assume !(main_~i~0 == 1); 7221#L12-2 assume !(main_~i~0 == 10); 7220#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7219#L18-1 assume true; 7218#L11-1 assume !!(main_~i~0 > 0); 7217#L12 assume !(main_~i~0 == 1); 7216#L12-2 assume !(main_~i~0 == 10); 7215#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7214#L18-1 assume true; 7213#L11-1 assume !!(main_~i~0 > 0); 7212#L12 assume !(main_~i~0 == 1); 7211#L12-2 assume !(main_~i~0 == 10); 7210#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7209#L18-1 assume true; 7208#L11-1 assume !!(main_~i~0 > 0); 7207#L12 assume !(main_~i~0 == 1); 7206#L12-2 assume !(main_~i~0 == 10); 7205#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7204#L18-1 assume true; 7203#L11-1 assume !!(main_~i~0 > 0); 7202#L12 assume !(main_~i~0 == 1); 7201#L12-2 assume !(main_~i~0 == 10); 7200#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7199#L18-1 assume true; 7198#L11-1 assume !!(main_~i~0 > 0); 7197#L12 assume !(main_~i~0 == 1); 7194#L12-2 assume !(main_~i~0 == 10); 7190#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7188#L18-1 assume true; 7181#L11-1 assume !!(main_~i~0 > 0); 7182#L12 assume main_~i~0 == 1;main_~up~0 := 1; 7094#L12-2 [2018-10-27 06:09:00,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:00,880 INFO L82 PathProgramCache]: Analyzing trace with hash -220451066, now seen corresponding path program 8 times [2018-10-27 06:09:00,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:00,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:00,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:00,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:00,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 115 proven. 7 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-27 06:09:00,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:00,974 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:00,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:09:01,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:09:01,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:01,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 115 proven. 7 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-27 06:09:01,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:01,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-27 06:09:01,048 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:01,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1773414175, now seen corresponding path program 7 times [2018-10-27 06:09:01,048 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:01,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:01,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:01,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 85 proven. 133 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:09:01,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:01,281 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:01,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:01,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 85 proven. 133 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:09:01,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:01,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-27 06:09:01,327 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:01,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:09:01,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:09:01,328 INFO L87 Difference]: Start difference. First operand 216 states and 255 transitions. cyclomatic complexity: 47 Second operand 11 states. [2018-10-27 06:09:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:01,417 INFO L93 Difference]: Finished difference Result 257 states and 305 transitions. [2018-10-27 06:09:01,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:09:01,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 305 transitions. [2018-10-27 06:09:01,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2018-10-27 06:09:01,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 251 states and 299 transitions. [2018-10-27 06:09:01,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2018-10-27 06:09:01,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2018-10-27 06:09:01,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 251 states and 299 transitions. [2018-10-27 06:09:01,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:01,422 INFO L705 BuchiCegarLoop]: Abstraction has 251 states and 299 transitions. [2018-10-27 06:09:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 299 transitions. [2018-10-27 06:09:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 236. [2018-10-27 06:09:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-27 06:09:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 279 transitions. [2018-10-27 06:09:01,431 INFO L728 BuchiCegarLoop]: Abstraction has 236 states and 279 transitions. [2018-10-27 06:09:01,431 INFO L608 BuchiCegarLoop]: Abstraction has 236 states and 279 transitions. [2018-10-27 06:09:01,431 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-10-27 06:09:01,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 236 states and 279 transitions. [2018-10-27 06:09:01,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2018-10-27 06:09:01,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:01,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:01,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 12, 10, 10, 9, 2, 2, 1, 1, 1] [2018-10-27 06:09:01,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 10, 10, 9, 2, 1, 1] [2018-10-27 06:09:01,433 INFO L793 eck$LassoCheckResult]: Stem: 7885#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7874#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 7875#L18-1 assume true; 7971#L11-1 assume !!(main_~i~0 > 0); 7975#L12 assume main_~i~0 == 1;main_~up~0 := 1; 7974#L12-2 assume !(main_~i~0 == 10); 7973#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 7972#L18-1 assume true; 7962#L11-1 assume !!(main_~i~0 > 0); 7969#L12 assume !(main_~i~0 == 1); 7967#L12-2 assume !(main_~i~0 == 10); 7965#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 7961#L18-1 assume true; 7959#L11-1 assume !!(main_~i~0 > 0); 7957#L12 assume !(main_~i~0 == 1); 7955#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 7889#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7890#L18-1 assume true; 8073#L11-1 assume !!(main_~i~0 > 0); 8072#L12 assume !(main_~i~0 == 1); 8071#L12-2 assume !(main_~i~0 == 10); 8070#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8069#L18-1 assume true; 8068#L11-1 assume !!(main_~i~0 > 0); 8067#L12 assume !(main_~i~0 == 1); 8066#L12-2 assume !(main_~i~0 == 10); 8065#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8064#L18-1 assume true; 8063#L11-1 assume !!(main_~i~0 > 0); 8062#L12 assume !(main_~i~0 == 1); 8061#L12-2 assume !(main_~i~0 == 10); 8060#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8059#L18-1 assume true; 8058#L11-1 assume !!(main_~i~0 > 0); 8057#L12 assume !(main_~i~0 == 1); 8056#L12-2 assume !(main_~i~0 == 10); 8055#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8054#L18-1 assume true; 8053#L11-1 assume !!(main_~i~0 > 0); 8052#L12 assume !(main_~i~0 == 1); 8051#L12-2 assume !(main_~i~0 == 10); 8050#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8049#L18-1 assume true; 8048#L11-1 assume !!(main_~i~0 > 0); 8047#L12 assume !(main_~i~0 == 1); 8046#L12-2 assume !(main_~i~0 == 10); 8045#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8044#L18-1 assume true; 8043#L11-1 assume !!(main_~i~0 > 0); 8042#L12 assume !(main_~i~0 == 1); 8041#L12-2 assume !(main_~i~0 == 10); 8040#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8038#L18-1 assume true; 7989#L11-1 assume !!(main_~i~0 > 0); 7999#L12 assume !(main_~i~0 == 1); 7995#L12-2 assume !(main_~i~0 == 10); 7992#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7988#L18-1 assume true; 7985#L11-1 assume !!(main_~i~0 > 0); 7897#L12 assume main_~i~0 == 1;main_~up~0 := 1; 7893#L12-2 [2018-10-27 06:09:01,433 INFO L795 eck$LassoCheckResult]: Loop: 7893#L12-2 assume !(main_~i~0 == 10); 7894#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 8079#L18-1 assume true; 8078#L11-1 assume !!(main_~i~0 > 0); 7895#L12 assume !(main_~i~0 == 1); 7896#L12-2 assume !(main_~i~0 == 10); 7979#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 7978#L18-1 assume true; 7976#L11-1 assume !!(main_~i~0 > 0); 7977#L12 assume !(main_~i~0 == 1); 8075#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 7881#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7892#L18-1 assume true; 8037#L11-1 assume !!(main_~i~0 > 0); 8036#L12 assume !(main_~i~0 == 1); 8035#L12-2 assume !(main_~i~0 == 10); 8034#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8033#L18-1 assume true; 8032#L11-1 assume !!(main_~i~0 > 0); 8031#L12 assume !(main_~i~0 == 1); 8030#L12-2 assume !(main_~i~0 == 10); 8029#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8028#L18-1 assume true; 8027#L11-1 assume !!(main_~i~0 > 0); 8026#L12 assume !(main_~i~0 == 1); 8025#L12-2 assume !(main_~i~0 == 10); 8024#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8023#L18-1 assume true; 8022#L11-1 assume !!(main_~i~0 > 0); 8021#L12 assume !(main_~i~0 == 1); 8020#L12-2 assume !(main_~i~0 == 10); 8019#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8018#L18-1 assume true; 8017#L11-1 assume !!(main_~i~0 > 0); 8016#L12 assume !(main_~i~0 == 1); 8015#L12-2 assume !(main_~i~0 == 10); 8014#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8013#L18-1 assume true; 8012#L11-1 assume !!(main_~i~0 > 0); 8011#L12 assume !(main_~i~0 == 1); 8010#L12-2 assume !(main_~i~0 == 10); 8009#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8008#L18-1 assume true; 8007#L11-1 assume !!(main_~i~0 > 0); 8006#L12 assume !(main_~i~0 == 1); 8005#L12-2 assume !(main_~i~0 == 10); 8004#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 8003#L18-1 assume true; 8002#L11-1 assume !!(main_~i~0 > 0); 8000#L12 assume !(main_~i~0 == 1); 7997#L12-2 assume !(main_~i~0 == 10); 7993#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 7990#L18-1 assume true; 7991#L11-1 assume !!(main_~i~0 > 0); 8001#L12 assume main_~i~0 == 1;main_~up~0 := 1; 7893#L12-2 [2018-10-27 06:09:01,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:01,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1184802469, now seen corresponding path program 9 times [2018-10-27 06:09:01,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:01,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:01,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:01,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 129 proven. 7 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:01,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:01,500 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:01,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:09:01,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-27 06:09:01,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:01,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 129 proven. 7 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:01,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:01,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-27 06:09:01,556 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:01,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:01,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1140285344, now seen corresponding path program 8 times [2018-10-27 06:09:01,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:01,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:01,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:01,793 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 45 [2018-10-27 06:09:01,800 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:01,800 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:01,800 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:01,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:01,800 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:09:01,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:01,801 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:01,801 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:01,801 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration16_Loop [2018-10-27 06:09:01,801 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:01,801 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:01,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:01,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:01,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:01,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:01,848 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:01,849 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:09:01,858 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:01,858 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:01,878 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:01,878 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:01,883 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:01,883 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:01,903 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:01,903 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_14=1} Honda state: {v_rep~unnamed0~0~true_14=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:01,907 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:01,908 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:01,927 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:01,927 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_14=0} Honda state: {v_rep~unnamed0~0~false_14=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:01,932 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:01,932 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:01,956 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:09:01,956 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:01,960 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:09:01,977 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:01,977 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:01,977 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:01,977 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:01,977 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:01,977 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:01,978 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:01,978 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:01,978 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration16_Loop [2018-10-27 06:09:01,978 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:01,978 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:01,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:01,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-10-27 06:09:01,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:01,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:02,045 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:02,045 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:02,046 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-10-27 06:09:02,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:02,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:02,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:02,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:02,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:02,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:02,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:02,048 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-10-27 06:09:02,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:02,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:02,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:02,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:02,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:02,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:02,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:02,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:02,055 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-10-27 06:09:02,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:02,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:02,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:02,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:02,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:02,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:02,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:02,058 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-10-27 06:09:02,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:02,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:02,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:02,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:02,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:02,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:02,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:02,060 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:02,061 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:02,061 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:09:02,069 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:02,069 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:09:02,069 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:02,070 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:09:02,070 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:09:02,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:02,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:02,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:02,166 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:09:02,166 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 236 states and 279 transitions. cyclomatic complexity: 51 Second operand 8 states. [2018-10-27 06:09:02,535 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 236 states and 279 transitions. cyclomatic complexity: 51. Second operand 8 states. Result 677 states and 793 transitions. Complement of second has 27 states. [2018-10-27 06:09:02,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:09:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2018-10-27 06:09:02,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 60 letters. Loop has 55 letters. [2018-10-27 06:09:02,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:02,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 115 letters. Loop has 55 letters. [2018-10-27 06:09:02,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:02,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 60 letters. Loop has 110 letters. [2018-10-27 06:09:02,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:02,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 677 states and 793 transitions. [2018-10-27 06:09:02,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2018-10-27 06:09:02,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 677 states to 505 states and 590 transitions. [2018-10-27 06:09:02,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-10-27 06:09:02,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2018-10-27 06:09:02,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 505 states and 590 transitions. [2018-10-27 06:09:02,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:02,544 INFO L705 BuchiCegarLoop]: Abstraction has 505 states and 590 transitions. [2018-10-27 06:09:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states and 590 transitions. [2018-10-27 06:09:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 367. [2018-10-27 06:09:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-27 06:09:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 433 transitions. [2018-10-27 06:09:02,550 INFO L728 BuchiCegarLoop]: Abstraction has 367 states and 433 transitions. [2018-10-27 06:09:02,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:09:02,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:09:02,551 INFO L87 Difference]: Start difference. First operand 367 states and 433 transitions. Second operand 5 states. [2018-10-27 06:09:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:02,580 INFO L93 Difference]: Finished difference Result 289 states and 333 transitions. [2018-10-27 06:09:02,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:09:02,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 289 states and 333 transitions. [2018-10-27 06:09:02,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-10-27 06:09:02,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 289 states to 269 states and 312 transitions. [2018-10-27 06:09:02,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2018-10-27 06:09:02,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2018-10-27 06:09:02,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 269 states and 312 transitions. [2018-10-27 06:09:02,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:02,584 INFO L705 BuchiCegarLoop]: Abstraction has 269 states and 312 transitions. [2018-10-27 06:09:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states and 312 transitions. [2018-10-27 06:09:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 256. [2018-10-27 06:09:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-27 06:09:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 299 transitions. [2018-10-27 06:09:02,593 INFO L728 BuchiCegarLoop]: Abstraction has 256 states and 299 transitions. [2018-10-27 06:09:02,593 INFO L608 BuchiCegarLoop]: Abstraction has 256 states and 299 transitions. [2018-10-27 06:09:02,593 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-10-27 06:09:02,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 299 transitions. [2018-10-27 06:09:02,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2018-10-27 06:09:02,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:02,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:02,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 11, 11, 9, 3, 2, 1, 1, 1] [2018-10-27 06:09:02,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 12, 11, 11, 9, 3, 1, 1] [2018-10-27 06:09:02,595 INFO L793 eck$LassoCheckResult]: Stem: 10043#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10033#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 10034#L18-1 assume true; 10200#L11-1 assume !!(main_~i~0 > 0); 10047#L12 assume main_~i~0 == 1;main_~up~0 := 1; 10039#L12-2 assume !(main_~i~0 == 10); 10040#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 10044#L18-1 assume true; 10045#L11-1 assume !!(main_~i~0 > 0); 10288#L12 assume !(main_~i~0 == 1); 10287#L12-2 assume !(main_~i~0 == 10); 10286#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 10046#L18-1 assume true; 10037#L11-1 assume !!(main_~i~0 > 0); 10038#L12 assume !(main_~i~0 == 1); 10041#L12-2 assume !(main_~i~0 == 10); 10042#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 10261#L18-1 assume true; 10035#L11-1 assume !!(main_~i~0 > 0); 10036#L12 assume !(main_~i~0 == 1); 10050#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 10235#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10234#L18-1 assume true; 10233#L11-1 assume !!(main_~i~0 > 0); 10232#L12 assume !(main_~i~0 == 1); 10231#L12-2 assume !(main_~i~0 == 10); 10230#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10229#L18-1 assume true; 10228#L11-1 assume !!(main_~i~0 > 0); 10227#L12 assume !(main_~i~0 == 1); 10226#L12-2 assume !(main_~i~0 == 10); 10225#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10224#L18-1 assume true; 10223#L11-1 assume !!(main_~i~0 > 0); 10222#L12 assume !(main_~i~0 == 1); 10221#L12-2 assume !(main_~i~0 == 10); 10220#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10219#L18-1 assume true; 10218#L11-1 assume !!(main_~i~0 > 0); 10217#L12 assume !(main_~i~0 == 1); 10216#L12-2 assume !(main_~i~0 == 10); 10215#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10214#L18-1 assume true; 10213#L11-1 assume !!(main_~i~0 > 0); 10212#L12 assume !(main_~i~0 == 1); 10211#L12-2 assume !(main_~i~0 == 10); 10210#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10209#L18-1 assume true; 10208#L11-1 assume !!(main_~i~0 > 0); 10205#L12 assume !(main_~i~0 == 1); 10204#L12-2 assume !(main_~i~0 == 10); 10203#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10202#L18-1 assume true; 10201#L11-1 assume !!(main_~i~0 > 0); 10198#L12 assume !(main_~i~0 == 1); 10196#L12-2 assume !(main_~i~0 == 10); 10194#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10191#L18-1 assume true; 10181#L11-1 assume !!(main_~i~0 > 0); 10188#L12 assume !(main_~i~0 == 1); 10185#L12-2 assume !(main_~i~0 == 10); 10183#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10180#L18-1 assume true; 10178#L11-1 assume !!(main_~i~0 > 0); 10176#L12 assume main_~i~0 == 1;main_~up~0 := 1; 10053#L12-2 [2018-10-27 06:09:02,595 INFO L795 eck$LassoCheckResult]: Loop: 10053#L12-2 assume !(main_~i~0 == 10); 10173#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 10171#L18-1 assume true; 10169#L11-1 assume !!(main_~i~0 > 0); 10167#L12 assume !(main_~i~0 == 1); 10166#L12-2 assume !(main_~i~0 == 10); 10165#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 10164#L18-1 assume true; 10163#L11-1 assume !!(main_~i~0 > 0); 10162#L12 assume !(main_~i~0 == 1); 10161#L12-2 assume !(main_~i~0 == 10); 10159#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 10156#L18-1 assume true; 10157#L11-1 assume !!(main_~i~0 > 0); 10148#L12 assume !(main_~i~0 == 1); 10149#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 10062#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10138#L18-1 assume true; 10136#L11-1 assume !!(main_~i~0 > 0); 10134#L12 assume !(main_~i~0 == 1); 10132#L12-2 assume !(main_~i~0 == 10); 10130#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10128#L18-1 assume true; 10126#L11-1 assume !!(main_~i~0 > 0); 10124#L12 assume !(main_~i~0 == 1); 10122#L12-2 assume !(main_~i~0 == 10); 10120#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10118#L18-1 assume true; 10116#L11-1 assume !!(main_~i~0 > 0); 10114#L12 assume !(main_~i~0 == 1); 10112#L12-2 assume !(main_~i~0 == 10); 10110#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10108#L18-1 assume true; 10106#L11-1 assume !!(main_~i~0 > 0); 10104#L12 assume !(main_~i~0 == 1); 10102#L12-2 assume !(main_~i~0 == 10); 10100#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10098#L18-1 assume true; 10096#L11-1 assume !!(main_~i~0 > 0); 10094#L12 assume !(main_~i~0 == 1); 10092#L12-2 assume !(main_~i~0 == 10); 10090#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10088#L18-1 assume true; 10086#L11-1 assume !!(main_~i~0 > 0); 10084#L12 assume !(main_~i~0 == 1); 10082#L12-2 assume !(main_~i~0 == 10); 10080#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10078#L18-1 assume true; 10076#L11-1 assume !!(main_~i~0 > 0); 10074#L12 assume !(main_~i~0 == 1); 10072#L12-2 assume !(main_~i~0 == 10); 10070#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10068#L18-1 assume true; 10066#L11-1 assume !!(main_~i~0 > 0); 10064#L12 assume !(main_~i~0 == 1); 10052#L12-2 assume !(main_~i~0 == 10); 10060#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 10058#L18-1 assume true; 10056#L11-1 assume !!(main_~i~0 > 0); 10051#L12 assume main_~i~0 == 1;main_~up~0 := 1; 10053#L12-2 [2018-10-27 06:09:02,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:02,595 INFO L82 PathProgramCache]: Analyzing trace with hash 697364320, now seen corresponding path program 10 times [2018-10-27 06:09:02,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:02,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:02,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:02,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:02,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 176 proven. 18 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:02,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:02,956 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:02,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:09:03,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:09:03,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:03,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 176 proven. 18 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:03,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:03,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-27 06:09:03,041 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:03,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:03,041 INFO L82 PathProgramCache]: Analyzing trace with hash -404339845, now seen corresponding path program 9 times [2018-10-27 06:09:03,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:03,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:03,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:03,178 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 48 [2018-10-27 06:09:03,184 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:03,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:03,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:03,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:03,184 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:09:03,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:03,184 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:03,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:03,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration17_Loop [2018-10-27 06:09:03,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:03,184 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:03,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:03,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:03,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:03,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:03,225 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:03,226 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:03,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:03,229 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:03,248 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:03,248 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_16=1} Honda state: {v_rep~unnamed0~0~true_16=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:03,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:03,253 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:09:03,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:09:03,311 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:03,317 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:09:03,334 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:03,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:03,334 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:03,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:03,334 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:03,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:03,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:03,334 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:03,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration17_Loop [2018-10-27 06:09:03,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:03,335 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:03,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:03,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:03,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:03,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:03,387 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:03,387 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:03,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:03,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:03,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:03,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:03,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:03,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:03,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:03,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:03,399 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-10-27 06:09:03,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:03,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:03,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:03,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:03,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:03,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:03,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:03,401 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:03,401 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:03,401 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:09:03,402 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:03,402 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:09:03,402 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:03,402 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:09:03,402 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:09:03,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:03,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:03,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:03,509 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-10-27 06:09:03,509 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 256 states and 299 transitions. cyclomatic complexity: 51 Second operand 7 states. [2018-10-27 06:09:03,651 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 256 states and 299 transitions. cyclomatic complexity: 51. Second operand 7 states. Result 860 states and 1000 transitions. Complement of second has 19 states. [2018-10-27 06:09:03,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:09:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2018-10-27 06:09:03,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 65 letters. Loop has 60 letters. [2018-10-27 06:09:03,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:03,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 125 letters. Loop has 60 letters. [2018-10-27 06:09:03,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:03,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 65 letters. Loop has 120 letters. [2018-10-27 06:09:03,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:03,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 860 states and 1000 transitions. [2018-10-27 06:09:03,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-10-27 06:09:03,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 860 states to 736 states and 842 transitions. [2018-10-27 06:09:03,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2018-10-27 06:09:03,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2018-10-27 06:09:03,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 736 states and 842 transitions. [2018-10-27 06:09:03,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:03,664 INFO L705 BuchiCegarLoop]: Abstraction has 736 states and 842 transitions. [2018-10-27 06:09:03,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states and 842 transitions. [2018-10-27 06:09:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 688. [2018-10-27 06:09:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-10-27 06:09:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 794 transitions. [2018-10-27 06:09:03,680 INFO L728 BuchiCegarLoop]: Abstraction has 688 states and 794 transitions. [2018-10-27 06:09:03,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:09:03,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:09:03,681 INFO L87 Difference]: Start difference. First operand 688 states and 794 transitions. Second operand 6 states. [2018-10-27 06:09:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:04,154 INFO L93 Difference]: Finished difference Result 334 states and 377 transitions. [2018-10-27 06:09:04,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:09:04,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 377 transitions. [2018-10-27 06:09:04,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-10-27 06:09:04,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 289 states and 332 transitions. [2018-10-27 06:09:04,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-10-27 06:09:04,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2018-10-27 06:09:04,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 332 transitions. [2018-10-27 06:09:04,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:04,160 INFO L705 BuchiCegarLoop]: Abstraction has 289 states and 332 transitions. [2018-10-27 06:09:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 332 transitions. [2018-10-27 06:09:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2018-10-27 06:09:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-27 06:09:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 319 transitions. [2018-10-27 06:09:04,171 INFO L728 BuchiCegarLoop]: Abstraction has 276 states and 319 transitions. [2018-10-27 06:09:04,171 INFO L608 BuchiCegarLoop]: Abstraction has 276 states and 319 transitions. [2018-10-27 06:09:04,171 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-10-27 06:09:04,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 319 transitions. [2018-10-27 06:09:04,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2018-10-27 06:09:04,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:04,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:04,174 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 14, 12, 12, 9, 4, 2, 1, 1, 1] [2018-10-27 06:09:04,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 13, 12, 12, 9, 4, 1, 1] [2018-10-27 06:09:04,174 INFO L793 eck$LassoCheckResult]: Stem: 12799#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12789#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 12790#L18-1 assume true; 13004#L11-1 assume !!(main_~i~0 > 0); 12802#L12 assume main_~i~0 == 1;main_~up~0 := 1; 12795#L12-2 assume !(main_~i~0 == 10); 12796#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 13059#L18-1 assume true; 13060#L11-1 assume !!(main_~i~0 > 0); 13064#L12 assume !(main_~i~0 == 1); 13063#L12-2 assume !(main_~i~0 == 10); 13062#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 13061#L18-1 assume true; 13058#L11-1 assume !!(main_~i~0 > 0); 13057#L12 assume !(main_~i~0 == 1); 12797#L12-2 assume !(main_~i~0 == 10); 12798#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 12801#L18-1 assume true; 12793#L11-1 assume !!(main_~i~0 > 0); 12794#L12 assume !(main_~i~0 == 1); 12803#L12-2 assume !(main_~i~0 == 10); 12934#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 12932#L18-1 assume true; 12930#L11-1 assume !!(main_~i~0 > 0); 12805#L12 assume !(main_~i~0 == 1); 12806#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 12980#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12979#L18-1 assume true; 12978#L11-1 assume !!(main_~i~0 > 0); 12977#L12 assume !(main_~i~0 == 1); 12976#L12-2 assume !(main_~i~0 == 10); 12975#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12974#L18-1 assume true; 12973#L11-1 assume !!(main_~i~0 > 0); 12972#L12 assume !(main_~i~0 == 1); 12971#L12-2 assume !(main_~i~0 == 10); 12970#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12969#L18-1 assume true; 12968#L11-1 assume !!(main_~i~0 > 0); 12967#L12 assume !(main_~i~0 == 1); 12966#L12-2 assume !(main_~i~0 == 10); 12965#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12964#L18-1 assume true; 12963#L11-1 assume !!(main_~i~0 > 0); 12962#L12 assume !(main_~i~0 == 1); 12961#L12-2 assume !(main_~i~0 == 10); 12960#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12959#L18-1 assume true; 12958#L11-1 assume !!(main_~i~0 > 0); 12957#L12 assume !(main_~i~0 == 1); 12956#L12-2 assume !(main_~i~0 == 10); 12955#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12954#L18-1 assume true; 12953#L11-1 assume !!(main_~i~0 > 0); 12952#L12 assume !(main_~i~0 == 1); 12951#L12-2 assume !(main_~i~0 == 10); 12950#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12949#L18-1 assume true; 12948#L11-1 assume !!(main_~i~0 > 0); 12947#L12 assume !(main_~i~0 == 1); 12946#L12-2 assume !(main_~i~0 == 10); 12945#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12944#L18-1 assume true; 12939#L11-1 assume !!(main_~i~0 > 0); 12943#L12 assume !(main_~i~0 == 1); 12941#L12-2 assume !(main_~i~0 == 10); 12940#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12938#L18-1 assume true; 12937#L11-1 assume !!(main_~i~0 > 0); 12936#L12 assume main_~i~0 == 1;main_~up~0 := 1; 12809#L12-2 [2018-10-27 06:09:04,174 INFO L795 eck$LassoCheckResult]: Loop: 12809#L12-2 assume !(main_~i~0 == 10); 12935#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 12933#L18-1 assume true; 12931#L11-1 assume !!(main_~i~0 > 0); 12928#L12 assume !(main_~i~0 == 1); 12927#L12-2 assume !(main_~i~0 == 10); 12926#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 12925#L18-1 assume true; 12924#L11-1 assume !!(main_~i~0 > 0); 12923#L12 assume !(main_~i~0 == 1); 12922#L12-2 assume !(main_~i~0 == 10); 12921#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 12920#L18-1 assume true; 12919#L11-1 assume !!(main_~i~0 > 0); 12918#L12 assume !(main_~i~0 == 1); 12916#L12-2 assume !(main_~i~0 == 10); 12914#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 12912#L18-1 assume true; 12906#L11-1 assume !!(main_~i~0 > 0); 12907#L12 assume !(main_~i~0 == 1); 12917#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 12818#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12894#L18-1 assume true; 12892#L11-1 assume !!(main_~i~0 > 0); 12890#L12 assume !(main_~i~0 == 1); 12888#L12-2 assume !(main_~i~0 == 10); 12886#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12884#L18-1 assume true; 12882#L11-1 assume !!(main_~i~0 > 0); 12880#L12 assume !(main_~i~0 == 1); 12878#L12-2 assume !(main_~i~0 == 10); 12876#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12874#L18-1 assume true; 12872#L11-1 assume !!(main_~i~0 > 0); 12870#L12 assume !(main_~i~0 == 1); 12868#L12-2 assume !(main_~i~0 == 10); 12866#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12864#L18-1 assume true; 12862#L11-1 assume !!(main_~i~0 > 0); 12860#L12 assume !(main_~i~0 == 1); 12858#L12-2 assume !(main_~i~0 == 10); 12856#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12854#L18-1 assume true; 12852#L11-1 assume !!(main_~i~0 > 0); 12850#L12 assume !(main_~i~0 == 1); 12848#L12-2 assume !(main_~i~0 == 10); 12846#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12844#L18-1 assume true; 12842#L11-1 assume !!(main_~i~0 > 0); 12840#L12 assume !(main_~i~0 == 1); 12838#L12-2 assume !(main_~i~0 == 10); 12836#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12834#L18-1 assume true; 12832#L11-1 assume !!(main_~i~0 > 0); 12830#L12 assume !(main_~i~0 == 1); 12828#L12-2 assume !(main_~i~0 == 10); 12826#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12824#L18-1 assume true; 12822#L11-1 assume !!(main_~i~0 > 0); 12820#L12 assume !(main_~i~0 == 1); 12808#L12-2 assume !(main_~i~0 == 10); 12816#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 12814#L18-1 assume true; 12812#L11-1 assume !!(main_~i~0 > 0); 12807#L12 assume main_~i~0 == 1;main_~up~0 := 1; 12809#L12-2 [2018-10-27 06:09:04,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:04,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2117555323, now seen corresponding path program 11 times [2018-10-27 06:09:04,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:04,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:04,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:04,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:04,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 223 proven. 34 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:04,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:04,580 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:04,590 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:09:04,603 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-10-27 06:09:04,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:04,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 223 proven. 34 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:04,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:04,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-27 06:09:04,635 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:04,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:04,635 INFO L82 PathProgramCache]: Analyzing trace with hash -232171200, now seen corresponding path program 10 times [2018-10-27 06:09:04,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:04,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:04,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:04,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:04,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:04,828 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 51 [2018-10-27 06:09:04,836 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:04,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:04,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:04,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:04,836 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:09:04,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:04,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:04,836 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:04,836 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration18_Loop [2018-10-27 06:09:04,836 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:04,837 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:04,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:04,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:04,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:04,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:04,886 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:04,887 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:04,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:04,891 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:04,912 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:04,912 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_18=1} Honda state: {v_rep~unnamed0~0~true_18=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:04,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:04,917 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:04,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:09:04,942 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:04,949 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:09:04,967 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:04,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:04,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:04,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:04,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:04,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:04,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:04,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:04,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration18_Loop [2018-10-27 06:09:04,968 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:04,968 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:04,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:04,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:04,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:04,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,030 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:05,030 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:05,030 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-10-27 06:09:05,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:05,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:05,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:05,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:05,032 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:05,033 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:05,033 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:09:05,034 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:05,034 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:09:05,034 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:05,034 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:09:05,034 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:09:05,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:05,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:05,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 218 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:05,146 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:09:05,146 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 276 states and 319 transitions. cyclomatic complexity: 51 Second operand 8 states. [2018-10-27 06:09:05,336 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 276 states and 319 transitions. cyclomatic complexity: 51. Second operand 8 states. Result 1037 states and 1201 transitions. Complement of second has 23 states. [2018-10-27 06:09:05,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:09:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2018-10-27 06:09:05,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 70 letters. Loop has 65 letters. [2018-10-27 06:09:05,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:05,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 135 letters. Loop has 65 letters. [2018-10-27 06:09:05,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:05,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 70 letters. Loop has 130 letters. [2018-10-27 06:09:05,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:05,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1037 states and 1201 transitions. [2018-10-27 06:09:05,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 70 [2018-10-27 06:09:05,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1037 states to 850 states and 971 transitions. [2018-10-27 06:09:05,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2018-10-27 06:09:05,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 170 [2018-10-27 06:09:05,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 971 transitions. [2018-10-27 06:09:05,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:05,363 INFO L705 BuchiCegarLoop]: Abstraction has 850 states and 971 transitions. [2018-10-27 06:09:05,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 971 transitions. [2018-10-27 06:09:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 789. [2018-10-27 06:09:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-27 06:09:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 910 transitions. [2018-10-27 06:09:05,379 INFO L728 BuchiCegarLoop]: Abstraction has 789 states and 910 transitions. [2018-10-27 06:09:05,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:09:05,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:09:05,380 INFO L87 Difference]: Start difference. First operand 789 states and 910 transitions. Second operand 7 states. [2018-10-27 06:09:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:05,746 INFO L93 Difference]: Finished difference Result 369 states and 412 transitions. [2018-10-27 06:09:05,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:09:05,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 369 states and 412 transitions. [2018-10-27 06:09:05,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2018-10-27 06:09:05,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 369 states to 309 states and 352 transitions. [2018-10-27 06:09:05,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2018-10-27 06:09:05,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2018-10-27 06:09:05,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 309 states and 352 transitions. [2018-10-27 06:09:05,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:05,753 INFO L705 BuchiCegarLoop]: Abstraction has 309 states and 352 transitions. [2018-10-27 06:09:05,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 352 transitions. [2018-10-27 06:09:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 296. [2018-10-27 06:09:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-27 06:09:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 339 transitions. [2018-10-27 06:09:05,764 INFO L728 BuchiCegarLoop]: Abstraction has 296 states and 339 transitions. [2018-10-27 06:09:05,765 INFO L608 BuchiCegarLoop]: Abstraction has 296 states and 339 transitions. [2018-10-27 06:09:05,765 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-10-27 06:09:05,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 339 transitions. [2018-10-27 06:09:05,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2018-10-27 06:09:05,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:05,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:05,773 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 13, 13, 9, 5, 2, 1, 1, 1] [2018-10-27 06:09:05,773 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [14, 14, 13, 13, 9, 5, 1, 1] [2018-10-27 06:09:05,773 INFO L793 eck$LassoCheckResult]: Stem: 15942#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 15932#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 15933#L18-1 assume true; 16135#L11-1 assume !!(main_~i~0 > 0); 15946#L12 assume main_~i~0 == 1;main_~up~0 := 1; 15947#L12-2 assume !(main_~i~0 == 10); 16179#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 16178#L18-1 assume true; 16177#L11-1 assume !!(main_~i~0 > 0); 16176#L12 assume !(main_~i~0 == 1); 16175#L12-2 assume !(main_~i~0 == 10); 16174#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 16173#L18-1 assume true; 16172#L11-1 assume !!(main_~i~0 > 0); 16171#L12 assume !(main_~i~0 == 1); 16170#L12-2 assume !(main_~i~0 == 10); 16169#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 16168#L18-1 assume true; 16167#L11-1 assume !!(main_~i~0 > 0); 16166#L12 assume !(main_~i~0 == 1); 16165#L12-2 assume !(main_~i~0 == 10); 16164#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 16163#L18-1 assume true; 16083#L11-1 assume !!(main_~i~0 > 0); 16161#L12 assume !(main_~i~0 == 1); 16159#L12-2 assume !(main_~i~0 == 10); 16086#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 16082#L18-1 assume true; 16079#L11-1 assume !!(main_~i~0 > 0); 15950#L12 assume !(main_~i~0 == 1); 15951#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 16158#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16157#L18-1 assume true; 16156#L11-1 assume !!(main_~i~0 > 0); 16155#L12 assume !(main_~i~0 == 1); 16154#L12-2 assume !(main_~i~0 == 10); 16153#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16152#L18-1 assume true; 16151#L11-1 assume !!(main_~i~0 > 0); 16150#L12 assume !(main_~i~0 == 1); 16149#L12-2 assume !(main_~i~0 == 10); 16148#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16147#L18-1 assume true; 16146#L11-1 assume !!(main_~i~0 > 0); 16145#L12 assume !(main_~i~0 == 1); 16144#L12-2 assume !(main_~i~0 == 10); 16143#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16142#L18-1 assume true; 16141#L11-1 assume !!(main_~i~0 > 0); 16140#L12 assume !(main_~i~0 == 1); 16139#L12-2 assume !(main_~i~0 == 10); 16138#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16137#L18-1 assume true; 16136#L11-1 assume !!(main_~i~0 > 0); 16133#L12 assume !(main_~i~0 == 1); 16131#L12-2 assume !(main_~i~0 == 10); 16129#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16125#L18-1 assume true; 16123#L11-1 assume !!(main_~i~0 > 0); 16121#L12 assume !(main_~i~0 == 1); 16119#L12-2 assume !(main_~i~0 == 10); 16117#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16115#L18-1 assume true; 16113#L11-1 assume !!(main_~i~0 > 0); 16111#L12 assume !(main_~i~0 == 1); 16109#L12-2 assume !(main_~i~0 == 10); 16107#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16105#L18-1 assume true; 16095#L11-1 assume !!(main_~i~0 > 0); 16102#L12 assume !(main_~i~0 == 1); 16099#L12-2 assume !(main_~i~0 == 10); 16097#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16094#L18-1 assume true; 16092#L11-1 assume !!(main_~i~0 > 0); 16090#L12 assume main_~i~0 == 1;main_~up~0 := 1; 15954#L12-2 [2018-10-27 06:09:05,773 INFO L795 eck$LassoCheckResult]: Loop: 15954#L12-2 assume !(main_~i~0 == 10); 16087#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 16084#L18-1 assume true; 16080#L11-1 assume !!(main_~i~0 > 0); 16077#L12 assume !(main_~i~0 == 1); 16076#L12-2 assume !(main_~i~0 == 10); 16075#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 16074#L18-1 assume true; 16073#L11-1 assume !!(main_~i~0 > 0); 16072#L12 assume !(main_~i~0 == 1); 16071#L12-2 assume !(main_~i~0 == 10); 16070#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 16069#L18-1 assume true; 16068#L11-1 assume !!(main_~i~0 > 0); 16067#L12 assume !(main_~i~0 == 1); 16066#L12-2 assume !(main_~i~0 == 10); 16065#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 16064#L18-1 assume true; 16063#L11-1 assume !!(main_~i~0 > 0); 16062#L12 assume !(main_~i~0 == 1); 16061#L12-2 assume !(main_~i~0 == 10); 16059#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 16055#L18-1 assume true; 16056#L11-1 assume !!(main_~i~0 > 0); 16049#L12 assume !(main_~i~0 == 1); 16050#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 15963#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16039#L18-1 assume true; 16037#L11-1 assume !!(main_~i~0 > 0); 16035#L12 assume !(main_~i~0 == 1); 16033#L12-2 assume !(main_~i~0 == 10); 16031#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16029#L18-1 assume true; 16027#L11-1 assume !!(main_~i~0 > 0); 16025#L12 assume !(main_~i~0 == 1); 16023#L12-2 assume !(main_~i~0 == 10); 16021#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16019#L18-1 assume true; 16017#L11-1 assume !!(main_~i~0 > 0); 16015#L12 assume !(main_~i~0 == 1); 16013#L12-2 assume !(main_~i~0 == 10); 16011#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 16009#L18-1 assume true; 16007#L11-1 assume !!(main_~i~0 > 0); 16005#L12 assume !(main_~i~0 == 1); 16003#L12-2 assume !(main_~i~0 == 10); 16001#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 15999#L18-1 assume true; 15997#L11-1 assume !!(main_~i~0 > 0); 15995#L12 assume !(main_~i~0 == 1); 15993#L12-2 assume !(main_~i~0 == 10); 15991#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 15989#L18-1 assume true; 15987#L11-1 assume !!(main_~i~0 > 0); 15985#L12 assume !(main_~i~0 == 1); 15983#L12-2 assume !(main_~i~0 == 10); 15981#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 15979#L18-1 assume true; 15977#L11-1 assume !!(main_~i~0 > 0); 15975#L12 assume !(main_~i~0 == 1); 15973#L12-2 assume !(main_~i~0 == 10); 15971#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 15969#L18-1 assume true; 15967#L11-1 assume !!(main_~i~0 > 0); 15965#L12 assume !(main_~i~0 == 1); 15953#L12-2 assume !(main_~i~0 == 10); 15961#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 15959#L18-1 assume true; 15957#L11-1 assume !!(main_~i~0 > 0); 15952#L12 assume main_~i~0 == 1;main_~up~0 := 1; 15954#L12-2 [2018-10-27 06:09:05,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:05,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1462048704, now seen corresponding path program 12 times [2018-10-27 06:09:05,774 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:05,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:05,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:05,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:05,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 270 proven. 55 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:05,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:05,993 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:06,002 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:09:06,016 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-10-27 06:09:06,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:06,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 270 proven. 55 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:06,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:06,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-27 06:09:06,061 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:06,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:06,061 INFO L82 PathProgramCache]: Analyzing trace with hash -4843877, now seen corresponding path program 11 times [2018-10-27 06:09:06,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:06,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:06,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:06,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:06,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:06,259 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 54 [2018-10-27 06:09:06,267 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:06,267 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:06,267 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:06,267 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:06,267 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:09:06,267 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:06,267 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:06,267 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:06,268 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration19_Loop [2018-10-27 06:09:06,268 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:06,268 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:06,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:06,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:06,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:06,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-10-27 06:09:06,427 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:06,427 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:09:06,430 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:06,430 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:06,452 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:06,452 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:06,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:06,457 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:06,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:09:06,483 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:06,515 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:09:06,516 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:06,516 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:06,516 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:06,516 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:06,517 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:06,517 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:06,517 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:06,517 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:06,517 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration19_Loop [2018-10-27 06:09:06,517 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:06,517 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:06,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:06,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:06,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:06,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:06,581 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:06,581 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:06,581 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-10-27 06:09:06,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:06,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:06,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:06,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:06,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:06,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:06,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:06,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:06,584 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-10-27 06:09:06,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:06,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:06,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:06,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:06,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:06,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:06,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:06,586 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:06,587 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:06,587 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:09:06,587 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:06,587 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:09:06,587 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:06,587 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:09:06,588 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:09:06,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:06,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:06,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:06,689 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-10-27 06:09:06,689 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 296 states and 339 transitions. cyclomatic complexity: 51 Second operand 9 states. [2018-10-27 06:09:07,013 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 296 states and 339 transitions. cyclomatic complexity: 51. Second operand 9 states. Result 1244 states and 1438 transitions. Complement of second has 27 states. [2018-10-27 06:09:07,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:09:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2018-10-27 06:09:07,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 75 letters. Loop has 70 letters. [2018-10-27 06:09:07,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:07,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 145 letters. Loop has 70 letters. [2018-10-27 06:09:07,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:07,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 75 letters. Loop has 140 letters. [2018-10-27 06:09:07,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:07,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1244 states and 1438 transitions. [2018-10-27 06:09:07,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2018-10-27 06:09:07,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1244 states to 979 states and 1118 transitions. [2018-10-27 06:09:07,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2018-10-27 06:09:07,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 181 [2018-10-27 06:09:07,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 979 states and 1118 transitions. [2018-10-27 06:09:07,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:07,027 INFO L705 BuchiCegarLoop]: Abstraction has 979 states and 1118 transitions. [2018-10-27 06:09:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states and 1118 transitions. [2018-10-27 06:09:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 905. [2018-10-27 06:09:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-10-27 06:09:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1044 transitions. [2018-10-27 06:09:07,038 INFO L728 BuchiCegarLoop]: Abstraction has 905 states and 1044 transitions. [2018-10-27 06:09:07,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:09:07,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:09:07,039 INFO L87 Difference]: Start difference. First operand 905 states and 1044 transitions. Second operand 8 states. [2018-10-27 06:09:07,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:07,287 INFO L93 Difference]: Finished difference Result 404 states and 447 transitions. [2018-10-27 06:09:07,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:09:07,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 447 transitions. [2018-10-27 06:09:07,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2018-10-27 06:09:07,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 329 states and 372 transitions. [2018-10-27 06:09:07,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-10-27 06:09:07,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2018-10-27 06:09:07,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 372 transitions. [2018-10-27 06:09:07,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:07,293 INFO L705 BuchiCegarLoop]: Abstraction has 329 states and 372 transitions. [2018-10-27 06:09:07,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 372 transitions. [2018-10-27 06:09:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 316. [2018-10-27 06:09:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-27 06:09:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 359 transitions. [2018-10-27 06:09:07,305 INFO L728 BuchiCegarLoop]: Abstraction has 316 states and 359 transitions. [2018-10-27 06:09:07,305 INFO L608 BuchiCegarLoop]: Abstraction has 316 states and 359 transitions. [2018-10-27 06:09:07,305 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-10-27 06:09:07,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 359 transitions. [2018-10-27 06:09:07,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-10-27 06:09:07,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:07,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:07,307 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 16, 14, 14, 9, 6, 2, 1, 1, 1] [2018-10-27 06:09:07,307 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [15, 15, 14, 14, 9, 6, 1, 1] [2018-10-27 06:09:07,308 INFO L793 eck$LassoCheckResult]: Stem: 19518#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 19507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 19508#L18-1 assume true; 19744#L11-1 assume !!(main_~i~0 > 0); 19522#L12 assume main_~i~0 == 1;main_~up~0 := 1; 19523#L12-2 assume !(main_~i~0 == 10); 19770#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19769#L18-1 assume true; 19768#L11-1 assume !!(main_~i~0 > 0); 19767#L12 assume !(main_~i~0 == 1); 19766#L12-2 assume !(main_~i~0 == 10); 19765#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19764#L18-1 assume true; 19763#L11-1 assume !!(main_~i~0 > 0); 19762#L12 assume !(main_~i~0 == 1); 19761#L12-2 assume !(main_~i~0 == 10); 19760#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19759#L18-1 assume true; 19758#L11-1 assume !!(main_~i~0 > 0); 19757#L12 assume !(main_~i~0 == 1); 19756#L12-2 assume !(main_~i~0 == 10); 19755#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19754#L18-1 assume true; 19753#L11-1 assume !!(main_~i~0 > 0); 19752#L12 assume !(main_~i~0 == 1); 19751#L12-2 assume !(main_~i~0 == 10); 19750#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19749#L18-1 assume true; 19738#L11-1 assume !!(main_~i~0 > 0); 19747#L12 assume !(main_~i~0 == 1); 19746#L12-2 assume !(main_~i~0 == 10); 19741#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19737#L18-1 assume true; 19735#L11-1 assume !!(main_~i~0 > 0); 19527#L12 assume !(main_~i~0 == 1); 19528#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 19708#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19707#L18-1 assume true; 19706#L11-1 assume !!(main_~i~0 > 0); 19705#L12 assume !(main_~i~0 == 1); 19704#L12-2 assume !(main_~i~0 == 10); 19703#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19702#L18-1 assume true; 19701#L11-1 assume !!(main_~i~0 > 0); 19700#L12 assume !(main_~i~0 == 1); 19699#L12-2 assume !(main_~i~0 == 10); 19698#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19697#L18-1 assume true; 19696#L11-1 assume !!(main_~i~0 > 0); 19695#L12 assume !(main_~i~0 == 1); 19694#L12-2 assume !(main_~i~0 == 10); 19693#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19692#L18-1 assume true; 19691#L11-1 assume !!(main_~i~0 > 0); 19690#L12 assume !(main_~i~0 == 1); 19689#L12-2 assume !(main_~i~0 == 10); 19688#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19687#L18-1 assume true; 19686#L11-1 assume !!(main_~i~0 > 0); 19685#L12 assume !(main_~i~0 == 1); 19684#L12-2 assume !(main_~i~0 == 10); 19683#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19682#L18-1 assume true; 19681#L11-1 assume !!(main_~i~0 > 0); 19680#L12 assume !(main_~i~0 == 1); 19679#L12-2 assume !(main_~i~0 == 10); 19678#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19677#L18-1 assume true; 19676#L11-1 assume !!(main_~i~0 > 0); 19675#L12 assume !(main_~i~0 == 1); 19674#L12-2 assume !(main_~i~0 == 10); 19673#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19672#L18-1 assume true; 19667#L11-1 assume !!(main_~i~0 > 0); 19671#L12 assume !(main_~i~0 == 1); 19669#L12-2 assume !(main_~i~0 == 10); 19668#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19666#L18-1 assume true; 19665#L11-1 assume !!(main_~i~0 > 0); 19664#L12 assume main_~i~0 == 1;main_~up~0 := 1; 19531#L12-2 [2018-10-27 06:09:07,308 INFO L795 eck$LassoCheckResult]: Loop: 19531#L12-2 assume !(main_~i~0 == 10); 19663#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19662#L18-1 assume true; 19661#L11-1 assume !!(main_~i~0 > 0); 19660#L12 assume !(main_~i~0 == 1); 19659#L12-2 assume !(main_~i~0 == 10); 19658#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19657#L18-1 assume true; 19656#L11-1 assume !!(main_~i~0 > 0); 19655#L12 assume !(main_~i~0 == 1); 19654#L12-2 assume !(main_~i~0 == 10); 19653#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19652#L18-1 assume true; 19651#L11-1 assume !!(main_~i~0 > 0); 19650#L12 assume !(main_~i~0 == 1); 19649#L12-2 assume !(main_~i~0 == 10); 19648#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19647#L18-1 assume true; 19646#L11-1 assume !!(main_~i~0 > 0); 19645#L12 assume !(main_~i~0 == 1); 19644#L12-2 assume !(main_~i~0 == 10); 19643#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19642#L18-1 assume true; 19641#L11-1 assume !!(main_~i~0 > 0); 19640#L12 assume !(main_~i~0 == 1); 19639#L12-2 assume !(main_~i~0 == 10); 19637#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 19634#L18-1 assume true; 19635#L11-1 assume !!(main_~i~0 > 0); 19626#L12 assume !(main_~i~0 == 1); 19627#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 19540#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19616#L18-1 assume true; 19614#L11-1 assume !!(main_~i~0 > 0); 19612#L12 assume !(main_~i~0 == 1); 19610#L12-2 assume !(main_~i~0 == 10); 19608#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19606#L18-1 assume true; 19604#L11-1 assume !!(main_~i~0 > 0); 19602#L12 assume !(main_~i~0 == 1); 19600#L12-2 assume !(main_~i~0 == 10); 19598#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19596#L18-1 assume true; 19594#L11-1 assume !!(main_~i~0 > 0); 19592#L12 assume !(main_~i~0 == 1); 19590#L12-2 assume !(main_~i~0 == 10); 19588#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19586#L18-1 assume true; 19584#L11-1 assume !!(main_~i~0 > 0); 19582#L12 assume !(main_~i~0 == 1); 19580#L12-2 assume !(main_~i~0 == 10); 19578#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19576#L18-1 assume true; 19574#L11-1 assume !!(main_~i~0 > 0); 19572#L12 assume !(main_~i~0 == 1); 19570#L12-2 assume !(main_~i~0 == 10); 19568#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19566#L18-1 assume true; 19564#L11-1 assume !!(main_~i~0 > 0); 19562#L12 assume !(main_~i~0 == 1); 19560#L12-2 assume !(main_~i~0 == 10); 19558#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19556#L18-1 assume true; 19554#L11-1 assume !!(main_~i~0 > 0); 19552#L12 assume !(main_~i~0 == 1); 19550#L12-2 assume !(main_~i~0 == 10); 19548#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19546#L18-1 assume true; 19544#L11-1 assume !!(main_~i~0 > 0); 19542#L12 assume !(main_~i~0 == 1); 19530#L12-2 assume !(main_~i~0 == 10); 19538#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 19536#L18-1 assume true; 19534#L11-1 assume !!(main_~i~0 > 0); 19529#L12 assume main_~i~0 == 1;main_~up~0 := 1; 19531#L12-2 [2018-10-27 06:09:07,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:07,308 INFO L82 PathProgramCache]: Analyzing trace with hash -727324773, now seen corresponding path program 13 times [2018-10-27 06:09:07,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:07,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:07,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:07,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:07,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 317 proven. 81 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:07,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:07,422 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:07,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:07,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 317 proven. 81 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:07,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:07,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-27 06:09:07,494 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:07,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:07,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1461683680, now seen corresponding path program 12 times [2018-10-27 06:09:07,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:07,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:07,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:07,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:07,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:07,736 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 57 [2018-10-27 06:09:07,742 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:07,742 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:07,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:07,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:07,742 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:09:07,742 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:07,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:07,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:07,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration20_Loop [2018-10-27 06:09:07,743 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:07,743 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:07,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:07,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:07,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:07,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:07,791 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:07,792 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:07,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:07,809 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:07,830 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:07,830 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_22=0} Honda state: {v_rep~unnamed0~0~false_22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:07,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:07,836 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:07,857 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:07,857 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_22=1} Honda state: {v_rep~unnamed0~0~true_22=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:09:07,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:07,863 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:07,884 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:07,884 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:07,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:07,890 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:07,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:09:07,913 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:07,916 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:09:07,932 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:07,932 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:07,932 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:07,932 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:07,933 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:07,933 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:07,933 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:07,933 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:07,933 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration20_Loop [2018-10-27 06:09:07,933 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:07,933 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:07,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:07,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-10-27 06:09:07,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:07,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:07,983 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:07,983 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:07,983 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-10-27 06:09:07,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:07,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:07,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:07,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:07,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:07,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:07,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:07,986 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-10-27 06:09:07,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:07,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:07,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:07,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:07,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:07,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:07,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:07,988 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-10-27 06:09:07,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:07,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:07,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:07,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:07,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:07,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:07,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:07,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:07,990 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-10-27 06:09:07,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:07,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:07,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:07,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:07,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:07,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:07,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:07,991 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:07,992 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:07,992 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:09:07,993 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:07,993 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:09:07,993 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:07,993 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:09:07,993 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:09:08,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:08,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:08,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 353 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:08,136 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-10-27 06:09:08,136 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 316 states and 359 transitions. cyclomatic complexity: 51 Second operand 10 states. [2018-10-27 06:09:08,389 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 316 states and 359 transitions. cyclomatic complexity: 51. Second operand 10 states. Result 1481 states and 1711 transitions. Complement of second has 31 states. [2018-10-27 06:09:08,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:09:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2018-10-27 06:09:08,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 86 transitions. Stem has 80 letters. Loop has 75 letters. [2018-10-27 06:09:08,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:08,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 86 transitions. Stem has 155 letters. Loop has 75 letters. [2018-10-27 06:09:08,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:08,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 86 transitions. Stem has 80 letters. Loop has 150 letters. [2018-10-27 06:09:08,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:08,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1481 states and 1711 transitions. [2018-10-27 06:09:08,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 80 [2018-10-27 06:09:08,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1481 states to 1123 states and 1283 transitions. [2018-10-27 06:09:08,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2018-10-27 06:09:08,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2018-10-27 06:09:08,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1123 states and 1283 transitions. [2018-10-27 06:09:08,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:08,404 INFO L705 BuchiCegarLoop]: Abstraction has 1123 states and 1283 transitions. [2018-10-27 06:09:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states and 1283 transitions. [2018-10-27 06:09:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1036. [2018-10-27 06:09:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-10-27 06:09:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1196 transitions. [2018-10-27 06:09:08,416 INFO L728 BuchiCegarLoop]: Abstraction has 1036 states and 1196 transitions. [2018-10-27 06:09:08,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:09:08,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:09:08,416 INFO L87 Difference]: Start difference. First operand 1036 states and 1196 transitions. Second operand 9 states. [2018-10-27 06:09:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:08,718 INFO L93 Difference]: Finished difference Result 439 states and 482 transitions. [2018-10-27 06:09:08,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:09:08,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 439 states and 482 transitions. [2018-10-27 06:09:08,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-10-27 06:09:08,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 439 states to 349 states and 392 transitions. [2018-10-27 06:09:08,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-10-27 06:09:08,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-10-27 06:09:08,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 349 states and 392 transitions. [2018-10-27 06:09:08,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:08,723 INFO L705 BuchiCegarLoop]: Abstraction has 349 states and 392 transitions. [2018-10-27 06:09:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states and 392 transitions. [2018-10-27 06:09:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 336. [2018-10-27 06:09:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-27 06:09:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 379 transitions. [2018-10-27 06:09:08,735 INFO L728 BuchiCegarLoop]: Abstraction has 336 states and 379 transitions. [2018-10-27 06:09:08,735 INFO L608 BuchiCegarLoop]: Abstraction has 336 states and 379 transitions. [2018-10-27 06:09:08,735 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-10-27 06:09:08,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 336 states and 379 transitions. [2018-10-27 06:09:08,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-10-27 06:09:08,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:08,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:08,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 17, 15, 15, 9, 7, 2, 1, 1, 1] [2018-10-27 06:09:08,745 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [16, 16, 15, 15, 9, 7, 1, 1] [2018-10-27 06:09:08,746 INFO L793 eck$LassoCheckResult]: Stem: 23569#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 23559#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 23560#L18-1 assume true; 23561#L11-1 assume !!(main_~i~0 > 0); 23562#L12 assume main_~i~0 == 1;main_~up~0 := 1; 23565#L12-2 assume !(main_~i~0 == 10); 23566#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23570#L18-1 assume true; 23571#L11-1 assume !!(main_~i~0 > 0); 23894#L12 assume !(main_~i~0 == 1); 23893#L12-2 assume !(main_~i~0 == 10); 23892#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23572#L18-1 assume true; 23563#L11-1 assume !!(main_~i~0 > 0); 23564#L12 assume !(main_~i~0 == 1); 23567#L12-2 assume !(main_~i~0 == 10); 23568#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23577#L18-1 assume true; 23891#L11-1 assume !!(main_~i~0 > 0); 23890#L12 assume !(main_~i~0 == 1); 23889#L12-2 assume !(main_~i~0 == 10); 23888#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23887#L18-1 assume true; 23886#L11-1 assume !!(main_~i~0 > 0); 23885#L12 assume !(main_~i~0 == 1); 23884#L12-2 assume !(main_~i~0 == 10); 23883#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23882#L18-1 assume true; 23881#L11-1 assume !!(main_~i~0 > 0); 23880#L12 assume !(main_~i~0 == 1); 23879#L12-2 assume !(main_~i~0 == 10); 23878#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23877#L18-1 assume true; 23799#L11-1 assume !!(main_~i~0 > 0); 23809#L12 assume !(main_~i~0 == 1); 23808#L12-2 assume !(main_~i~0 == 10); 23803#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23798#L18-1 assume true; 23796#L11-1 assume !!(main_~i~0 > 0); 23578#L12 assume !(main_~i~0 == 1); 23579#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 23764#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23763#L18-1 assume true; 23762#L11-1 assume !!(main_~i~0 > 0); 23761#L12 assume !(main_~i~0 == 1); 23760#L12-2 assume !(main_~i~0 == 10); 23759#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23758#L18-1 assume true; 23757#L11-1 assume !!(main_~i~0 > 0); 23756#L12 assume !(main_~i~0 == 1); 23755#L12-2 assume !(main_~i~0 == 10); 23754#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23753#L18-1 assume true; 23752#L11-1 assume !!(main_~i~0 > 0); 23751#L12 assume !(main_~i~0 == 1); 23750#L12-2 assume !(main_~i~0 == 10); 23749#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23748#L18-1 assume true; 23747#L11-1 assume !!(main_~i~0 > 0); 23746#L12 assume !(main_~i~0 == 1); 23745#L12-2 assume !(main_~i~0 == 10); 23744#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23743#L18-1 assume true; 23742#L11-1 assume !!(main_~i~0 > 0); 23741#L12 assume !(main_~i~0 == 1); 23740#L12-2 assume !(main_~i~0 == 10); 23739#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23738#L18-1 assume true; 23737#L11-1 assume !!(main_~i~0 > 0); 23736#L12 assume !(main_~i~0 == 1); 23735#L12-2 assume !(main_~i~0 == 10); 23734#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23733#L18-1 assume true; 23732#L11-1 assume !!(main_~i~0 > 0); 23731#L12 assume !(main_~i~0 == 1); 23730#L12-2 assume !(main_~i~0 == 10); 23729#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23728#L18-1 assume true; 23723#L11-1 assume !!(main_~i~0 > 0); 23727#L12 assume !(main_~i~0 == 1); 23725#L12-2 assume !(main_~i~0 == 10); 23724#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23722#L18-1 assume true; 23721#L11-1 assume !!(main_~i~0 > 0); 23720#L12 assume main_~i~0 == 1;main_~up~0 := 1; 23582#L12-2 [2018-10-27 06:09:08,746 INFO L795 eck$LassoCheckResult]: Loop: 23582#L12-2 assume !(main_~i~0 == 10); 23719#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23718#L18-1 assume true; 23717#L11-1 assume !!(main_~i~0 > 0); 23716#L12 assume !(main_~i~0 == 1); 23715#L12-2 assume !(main_~i~0 == 10); 23714#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23713#L18-1 assume true; 23712#L11-1 assume !!(main_~i~0 > 0); 23711#L12 assume !(main_~i~0 == 1); 23710#L12-2 assume !(main_~i~0 == 10); 23709#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23708#L18-1 assume true; 23707#L11-1 assume !!(main_~i~0 > 0); 23706#L12 assume !(main_~i~0 == 1); 23705#L12-2 assume !(main_~i~0 == 10); 23704#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23703#L18-1 assume true; 23702#L11-1 assume !!(main_~i~0 > 0); 23701#L12 assume !(main_~i~0 == 1); 23700#L12-2 assume !(main_~i~0 == 10); 23699#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23698#L18-1 assume true; 23697#L11-1 assume !!(main_~i~0 > 0); 23696#L12 assume !(main_~i~0 == 1); 23695#L12-2 assume !(main_~i~0 == 10); 23694#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23693#L18-1 assume true; 23692#L11-1 assume !!(main_~i~0 > 0); 23691#L12 assume !(main_~i~0 == 1); 23689#L12-2 assume !(main_~i~0 == 10); 23687#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 23685#L18-1 assume true; 23679#L11-1 assume !!(main_~i~0 > 0); 23680#L12 assume !(main_~i~0 == 1); 23690#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 23591#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23667#L18-1 assume true; 23665#L11-1 assume !!(main_~i~0 > 0); 23663#L12 assume !(main_~i~0 == 1); 23661#L12-2 assume !(main_~i~0 == 10); 23659#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23657#L18-1 assume true; 23655#L11-1 assume !!(main_~i~0 > 0); 23653#L12 assume !(main_~i~0 == 1); 23651#L12-2 assume !(main_~i~0 == 10); 23649#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23647#L18-1 assume true; 23645#L11-1 assume !!(main_~i~0 > 0); 23643#L12 assume !(main_~i~0 == 1); 23641#L12-2 assume !(main_~i~0 == 10); 23639#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23637#L18-1 assume true; 23635#L11-1 assume !!(main_~i~0 > 0); 23633#L12 assume !(main_~i~0 == 1); 23631#L12-2 assume !(main_~i~0 == 10); 23629#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23627#L18-1 assume true; 23625#L11-1 assume !!(main_~i~0 > 0); 23623#L12 assume !(main_~i~0 == 1); 23621#L12-2 assume !(main_~i~0 == 10); 23619#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23617#L18-1 assume true; 23615#L11-1 assume !!(main_~i~0 > 0); 23613#L12 assume !(main_~i~0 == 1); 23611#L12-2 assume !(main_~i~0 == 10); 23609#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23607#L18-1 assume true; 23605#L11-1 assume !!(main_~i~0 > 0); 23603#L12 assume !(main_~i~0 == 1); 23601#L12-2 assume !(main_~i~0 == 10); 23599#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23597#L18-1 assume true; 23595#L11-1 assume !!(main_~i~0 > 0); 23593#L12 assume !(main_~i~0 == 1); 23581#L12-2 assume !(main_~i~0 == 10); 23589#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 23587#L18-1 assume true; 23585#L11-1 assume !!(main_~i~0 > 0); 23580#L12 assume main_~i~0 == 1;main_~up~0 := 1; 23582#L12-2 [2018-10-27 06:09:08,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:08,746 INFO L82 PathProgramCache]: Analyzing trace with hash 908806432, now seen corresponding path program 14 times [2018-10-27 06:09:08,746 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:08,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:08,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:08,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:08,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 364 proven. 112 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:09,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:09,032 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:09,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:09:09,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:09:09,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:09,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 364 proven. 112 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:09,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:09,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-27 06:09:09,079 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:09,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:09,079 INFO L82 PathProgramCache]: Analyzing trace with hash -55541317, now seen corresponding path program 13 times [2018-10-27 06:09:09,079 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:09,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:09,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:09,667 WARN L179 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 60 [2018-10-27 06:09:09,673 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:09,673 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:09,673 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:09,673 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:09,673 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:09:09,673 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:09,673 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:09,673 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:09,673 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration21_Loop [2018-10-27 06:09:09,673 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:09,674 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:09,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:09,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:09,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:09,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:09,723 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:09,723 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:09,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:09,727 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:09,749 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:09,749 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_24=1} Honda state: {v_rep~unnamed0~0~true_24=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:09,754 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:09,754 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:09,773 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:09,774 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_24=0} Honda state: {v_rep~unnamed0~0~false_24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:09,780 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:09,780 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:09,801 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:09,801 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:09,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:09,811 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:09,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:09:09,836 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:09,846 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:09:09,862 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:09,862 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:09,862 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:09,863 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:09,863 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:09,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:09,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:09,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:09,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration21_Loop [2018-10-27 06:09:09,863 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:09,863 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:09,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:09,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:09,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:09,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:09,919 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:09,919 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:09,920 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-10-27 06:09:09,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:09,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:09,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:09,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:09,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:09,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:09,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:09,922 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-10-27 06:09:09,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:09,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:09,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:09,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:09,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:09,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:09,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:09,924 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-10-27 06:09:09,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:09,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:09,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:09,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:09,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:09,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:09,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:09,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:09,926 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-10-27 06:09:09,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:09,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:09,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:09,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:09,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:09,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:09,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:09,928 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:09,929 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:09,929 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:09:09,929 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:09,929 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:09:09,929 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:09,929 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:09:09,929 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:09:09,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:10,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:10,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 428 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:10,090 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-10-27 06:09:10,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 336 states and 379 transitions. cyclomatic complexity: 51 Second operand 11 states. [2018-10-27 06:09:10,487 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 336 states and 379 transitions. cyclomatic complexity: 51. Second operand 11 states. Result 1748 states and 2020 transitions. Complement of second has 35 states. [2018-10-27 06:09:10,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-27 06:09:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 97 transitions. [2018-10-27 06:09:10,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 97 transitions. Stem has 85 letters. Loop has 80 letters. [2018-10-27 06:09:10,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:10,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 97 transitions. Stem has 165 letters. Loop has 80 letters. [2018-10-27 06:09:10,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:10,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 97 transitions. Stem has 85 letters. Loop has 160 letters. [2018-10-27 06:09:10,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:10,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1748 states and 2020 transitions. [2018-10-27 06:09:10,504 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-10-27 06:09:10,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1748 states to 1282 states and 1466 transitions. [2018-10-27 06:09:10,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 192 [2018-10-27 06:09:10,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2018-10-27 06:09:10,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1466 transitions. [2018-10-27 06:09:10,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:10,512 INFO L705 BuchiCegarLoop]: Abstraction has 1282 states and 1466 transitions. [2018-10-27 06:09:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1466 transitions. [2018-10-27 06:09:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1182. [2018-10-27 06:09:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2018-10-27 06:09:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1366 transitions. [2018-10-27 06:09:10,527 INFO L728 BuchiCegarLoop]: Abstraction has 1182 states and 1366 transitions. [2018-10-27 06:09:10,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:09:10,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:09:10,528 INFO L87 Difference]: Start difference. First operand 1182 states and 1366 transitions. Second operand 10 states. [2018-10-27 06:09:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:11,094 INFO L93 Difference]: Finished difference Result 474 states and 517 transitions. [2018-10-27 06:09:11,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:09:11,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 474 states and 517 transitions. [2018-10-27 06:09:11,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 86 [2018-10-27 06:09:11,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 474 states to 369 states and 412 transitions. [2018-10-27 06:09:11,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2018-10-27 06:09:11,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2018-10-27 06:09:11,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 369 states and 412 transitions. [2018-10-27 06:09:11,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:11,099 INFO L705 BuchiCegarLoop]: Abstraction has 369 states and 412 transitions. [2018-10-27 06:09:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states and 412 transitions. [2018-10-27 06:09:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 356. [2018-10-27 06:09:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-27 06:09:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 399 transitions. [2018-10-27 06:09:11,106 INFO L728 BuchiCegarLoop]: Abstraction has 356 states and 399 transitions. [2018-10-27 06:09:11,107 INFO L608 BuchiCegarLoop]: Abstraction has 356 states and 399 transitions. [2018-10-27 06:09:11,107 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-10-27 06:09:11,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 356 states and 399 transitions. [2018-10-27 06:09:11,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2018-10-27 06:09:11,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:11,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:11,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 18, 16, 16, 9, 8, 2, 1, 1, 1] [2018-10-27 06:09:11,109 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [17, 17, 16, 16, 9, 8, 1, 1] [2018-10-27 06:09:11,109 INFO L793 eck$LassoCheckResult]: Stem: 28144#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 28133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 28134#L18-1 assume true; 28390#L11-1 assume !!(main_~i~0 > 0); 28148#L12 assume main_~i~0 == 1;main_~up~0 := 1; 28149#L12-2 assume !(main_~i~0 == 10); 28426#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28425#L18-1 assume true; 28424#L11-1 assume !!(main_~i~0 > 0); 28423#L12 assume !(main_~i~0 == 1); 28422#L12-2 assume !(main_~i~0 == 10); 28421#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28420#L18-1 assume true; 28419#L11-1 assume !!(main_~i~0 > 0); 28418#L12 assume !(main_~i~0 == 1); 28417#L12-2 assume !(main_~i~0 == 10); 28416#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28415#L18-1 assume true; 28414#L11-1 assume !!(main_~i~0 > 0); 28413#L12 assume !(main_~i~0 == 1); 28412#L12-2 assume !(main_~i~0 == 10); 28411#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28410#L18-1 assume true; 28409#L11-1 assume !!(main_~i~0 > 0); 28408#L12 assume !(main_~i~0 == 1); 28407#L12-2 assume !(main_~i~0 == 10); 28406#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28405#L18-1 assume true; 28404#L11-1 assume !!(main_~i~0 > 0); 28403#L12 assume !(main_~i~0 == 1); 28402#L12-2 assume !(main_~i~0 == 10); 28401#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28400#L18-1 assume true; 28399#L11-1 assume !!(main_~i~0 > 0); 28398#L12 assume !(main_~i~0 == 1); 28397#L12-2 assume !(main_~i~0 == 10); 28396#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28395#L18-1 assume true; 28384#L11-1 assume !!(main_~i~0 > 0); 28393#L12 assume !(main_~i~0 == 1); 28392#L12-2 assume !(main_~i~0 == 10); 28387#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28383#L18-1 assume true; 28381#L11-1 assume !!(main_~i~0 > 0); 28153#L12 assume !(main_~i~0 == 1); 28154#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 28343#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28342#L18-1 assume true; 28341#L11-1 assume !!(main_~i~0 > 0); 28340#L12 assume !(main_~i~0 == 1); 28339#L12-2 assume !(main_~i~0 == 10); 28338#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28337#L18-1 assume true; 28336#L11-1 assume !!(main_~i~0 > 0); 28335#L12 assume !(main_~i~0 == 1); 28334#L12-2 assume !(main_~i~0 == 10); 28333#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28332#L18-1 assume true; 28331#L11-1 assume !!(main_~i~0 > 0); 28330#L12 assume !(main_~i~0 == 1); 28329#L12-2 assume !(main_~i~0 == 10); 28328#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28327#L18-1 assume true; 28326#L11-1 assume !!(main_~i~0 > 0); 28325#L12 assume !(main_~i~0 == 1); 28324#L12-2 assume !(main_~i~0 == 10); 28323#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28322#L18-1 assume true; 28321#L11-1 assume !!(main_~i~0 > 0); 28320#L12 assume !(main_~i~0 == 1); 28319#L12-2 assume !(main_~i~0 == 10); 28318#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28317#L18-1 assume true; 28316#L11-1 assume !!(main_~i~0 > 0); 28315#L12 assume !(main_~i~0 == 1); 28314#L12-2 assume !(main_~i~0 == 10); 28313#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28312#L18-1 assume true; 28311#L11-1 assume !!(main_~i~0 > 0); 28310#L12 assume !(main_~i~0 == 1); 28309#L12-2 assume !(main_~i~0 == 10); 28308#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28307#L18-1 assume true; 28302#L11-1 assume !!(main_~i~0 > 0); 28306#L12 assume !(main_~i~0 == 1); 28304#L12-2 assume !(main_~i~0 == 10); 28303#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28301#L18-1 assume true; 28300#L11-1 assume !!(main_~i~0 > 0); 28299#L12 assume main_~i~0 == 1;main_~up~0 := 1; 28157#L12-2 [2018-10-27 06:09:11,118 INFO L795 eck$LassoCheckResult]: Loop: 28157#L12-2 assume !(main_~i~0 == 10); 28298#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28297#L18-1 assume true; 28296#L11-1 assume !!(main_~i~0 > 0); 28295#L12 assume !(main_~i~0 == 1); 28294#L12-2 assume !(main_~i~0 == 10); 28293#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28292#L18-1 assume true; 28291#L11-1 assume !!(main_~i~0 > 0); 28290#L12 assume !(main_~i~0 == 1); 28289#L12-2 assume !(main_~i~0 == 10); 28288#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28287#L18-1 assume true; 28286#L11-1 assume !!(main_~i~0 > 0); 28285#L12 assume !(main_~i~0 == 1); 28284#L12-2 assume !(main_~i~0 == 10); 28283#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28282#L18-1 assume true; 28281#L11-1 assume !!(main_~i~0 > 0); 28280#L12 assume !(main_~i~0 == 1); 28279#L12-2 assume !(main_~i~0 == 10); 28278#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28277#L18-1 assume true; 28276#L11-1 assume !!(main_~i~0 > 0); 28275#L12 assume !(main_~i~0 == 1); 28274#L12-2 assume !(main_~i~0 == 10); 28273#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28272#L18-1 assume true; 28271#L11-1 assume !!(main_~i~0 > 0); 28270#L12 assume !(main_~i~0 == 1); 28269#L12-2 assume !(main_~i~0 == 10); 28268#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28267#L18-1 assume true; 28266#L11-1 assume !!(main_~i~0 > 0); 28265#L12 assume !(main_~i~0 == 1); 28263#L12-2 assume !(main_~i~0 == 10); 28261#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 28257#L18-1 assume true; 28254#L11-1 assume !!(main_~i~0 > 0); 28255#L12 assume !(main_~i~0 == 1); 28264#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 28166#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28242#L18-1 assume true; 28240#L11-1 assume !!(main_~i~0 > 0); 28238#L12 assume !(main_~i~0 == 1); 28236#L12-2 assume !(main_~i~0 == 10); 28234#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28232#L18-1 assume true; 28230#L11-1 assume !!(main_~i~0 > 0); 28228#L12 assume !(main_~i~0 == 1); 28226#L12-2 assume !(main_~i~0 == 10); 28224#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28222#L18-1 assume true; 28220#L11-1 assume !!(main_~i~0 > 0); 28218#L12 assume !(main_~i~0 == 1); 28216#L12-2 assume !(main_~i~0 == 10); 28214#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28212#L18-1 assume true; 28210#L11-1 assume !!(main_~i~0 > 0); 28208#L12 assume !(main_~i~0 == 1); 28206#L12-2 assume !(main_~i~0 == 10); 28204#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28202#L18-1 assume true; 28200#L11-1 assume !!(main_~i~0 > 0); 28198#L12 assume !(main_~i~0 == 1); 28196#L12-2 assume !(main_~i~0 == 10); 28194#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28192#L18-1 assume true; 28190#L11-1 assume !!(main_~i~0 > 0); 28188#L12 assume !(main_~i~0 == 1); 28186#L12-2 assume !(main_~i~0 == 10); 28184#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28182#L18-1 assume true; 28180#L11-1 assume !!(main_~i~0 > 0); 28178#L12 assume !(main_~i~0 == 1); 28176#L12-2 assume !(main_~i~0 == 10); 28174#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28172#L18-1 assume true; 28170#L11-1 assume !!(main_~i~0 > 0); 28168#L12 assume !(main_~i~0 == 1); 28156#L12-2 assume !(main_~i~0 == 10); 28164#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 28162#L18-1 assume true; 28160#L11-1 assume !!(main_~i~0 > 0); 28155#L12 assume main_~i~0 == 1;main_~up~0 := 1; 28157#L12-2 [2018-10-27 06:09:11,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1758401211, now seen corresponding path program 15 times [2018-10-27 06:09:11,119 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:11,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:11,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 411 proven. 148 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:11,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:11,193 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:11,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:09:11,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-27 06:09:11,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:11,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 411 proven. 148 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:11,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:11,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-27 06:09:11,248 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:11,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:11,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2058616064, now seen corresponding path program 14 times [2018-10-27 06:09:11,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:11,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:11,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:11,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:11,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:11,484 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 63 [2018-10-27 06:09:11,488 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:11,488 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:11,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:11,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:11,489 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:09:11,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:11,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:11,489 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:11,489 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration22_Loop [2018-10-27 06:09:11,489 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:11,489 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:11,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,536 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:11,536 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:11,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:11,540 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:11,558 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:11,558 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_26=1} Honda state: {v_rep~unnamed0~0~true_26=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:11,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:11,563 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:11,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:09:11,584 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:11,644 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:09:11,645 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:11,645 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:11,645 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:11,645 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:11,645 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:11,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:11,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:11,646 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:11,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration22_Loop [2018-10-27 06:09:11,646 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:11,646 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:11,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,689 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:11,689 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:11,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:11,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:11,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:11,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:11,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:11,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:11,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:11,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:11,692 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-10-27 06:09:11,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:11,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:11,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:11,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:11,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:11,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:11,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:11,694 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:11,695 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:11,695 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:09:11,695 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:11,695 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:09:11,695 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:11,695 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:09:11,696 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:09:11,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:11,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:11,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 508 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-27 06:09:11,820 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2018-10-27 06:09:11,820 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 356 states and 399 transitions. cyclomatic complexity: 51 Second operand 12 states. [2018-10-27 06:09:12,284 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 356 states and 399 transitions. cyclomatic complexity: 51. Second operand 12 states. Result 2045 states and 2367 transitions. Complement of second has 39 states. [2018-10-27 06:09:12,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-27 06:09:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 108 transitions. [2018-10-27 06:09:12,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 108 transitions. Stem has 90 letters. Loop has 85 letters. [2018-10-27 06:09:12,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:12,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 108 transitions. Stem has 175 letters. Loop has 85 letters. [2018-10-27 06:09:12,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:12,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 108 transitions. Stem has 90 letters. Loop has 170 letters. [2018-10-27 06:09:12,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:12,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2045 states and 2367 transitions. [2018-10-27 06:09:12,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2018-10-27 06:09:12,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2045 states to 1456 states and 1669 transitions. [2018-10-27 06:09:12,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 202 [2018-10-27 06:09:12,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2018-10-27 06:09:12,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1456 states and 1669 transitions. [2018-10-27 06:09:12,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:12,301 INFO L705 BuchiCegarLoop]: Abstraction has 1456 states and 1669 transitions. [2018-10-27 06:09:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states and 1669 transitions. [2018-10-27 06:09:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1343. [2018-10-27 06:09:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2018-10-27 06:09:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1556 transitions. [2018-10-27 06:09:12,320 INFO L728 BuchiCegarLoop]: Abstraction has 1343 states and 1556 transitions. [2018-10-27 06:09:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:09:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:09:12,320 INFO L87 Difference]: Start difference. First operand 1343 states and 1556 transitions. Second operand 11 states. [2018-10-27 06:09:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:12,419 INFO L93 Difference]: Finished difference Result 509 states and 552 transitions. [2018-10-27 06:09:12,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:09:12,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 509 states and 552 transitions. [2018-10-27 06:09:12,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2018-10-27 06:09:12,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 509 states to 389 states and 432 transitions. [2018-10-27 06:09:12,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2018-10-27 06:09:12,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2018-10-27 06:09:12,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 389 states and 432 transitions. [2018-10-27 06:09:12,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:12,424 INFO L705 BuchiCegarLoop]: Abstraction has 389 states and 432 transitions. [2018-10-27 06:09:12,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states and 432 transitions. [2018-10-27 06:09:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 376. [2018-10-27 06:09:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-10-27 06:09:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 419 transitions. [2018-10-27 06:09:12,429 INFO L728 BuchiCegarLoop]: Abstraction has 376 states and 419 transitions. [2018-10-27 06:09:12,437 INFO L608 BuchiCegarLoop]: Abstraction has 376 states and 419 transitions. [2018-10-27 06:09:12,437 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-10-27 06:09:12,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 376 states and 419 transitions. [2018-10-27 06:09:12,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-10-27 06:09:12,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:12,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:12,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 19, 17, 17, 9, 9, 2, 1, 1, 1] [2018-10-27 06:09:12,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [18, 18, 17, 17, 9, 9, 1, 1] [2018-10-27 06:09:12,440 INFO L793 eck$LassoCheckResult]: Stem: 33284#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 33274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 33275#L18-1 assume true; 33276#L11-1 assume !!(main_~i~0 > 0); 33277#L12 assume main_~i~0 == 1;main_~up~0 := 1; 33280#L12-2 assume !(main_~i~0 == 10); 33281#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33285#L18-1 assume true; 33286#L11-1 assume !!(main_~i~0 > 0); 33649#L12 assume !(main_~i~0 == 1); 33648#L12-2 assume !(main_~i~0 == 10); 33647#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33287#L18-1 assume true; 33278#L11-1 assume !!(main_~i~0 > 0); 33279#L12 assume !(main_~i~0 == 1); 33282#L12-2 assume !(main_~i~0 == 10); 33283#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33292#L18-1 assume true; 33646#L11-1 assume !!(main_~i~0 > 0); 33645#L12 assume !(main_~i~0 == 1); 33644#L12-2 assume !(main_~i~0 == 10); 33643#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33642#L18-1 assume true; 33641#L11-1 assume !!(main_~i~0 > 0); 33640#L12 assume !(main_~i~0 == 1); 33639#L12-2 assume !(main_~i~0 == 10); 33638#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33637#L18-1 assume true; 33636#L11-1 assume !!(main_~i~0 > 0); 33635#L12 assume !(main_~i~0 == 1); 33634#L12-2 assume !(main_~i~0 == 10); 33633#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33632#L18-1 assume true; 33631#L11-1 assume !!(main_~i~0 > 0); 33630#L12 assume !(main_~i~0 == 1); 33629#L12-2 assume !(main_~i~0 == 10); 33628#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33627#L18-1 assume true; 33626#L11-1 assume !!(main_~i~0 > 0); 33625#L12 assume !(main_~i~0 == 1); 33624#L12-2 assume !(main_~i~0 == 10); 33623#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33622#L18-1 assume true; 33534#L11-1 assume !!(main_~i~0 > 0); 33544#L12 assume !(main_~i~0 == 1); 33543#L12-2 assume !(main_~i~0 == 10); 33538#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33533#L18-1 assume true; 33531#L11-1 assume !!(main_~i~0 > 0); 33293#L12 assume !(main_~i~0 == 1); 33294#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 33488#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33487#L18-1 assume true; 33486#L11-1 assume !!(main_~i~0 > 0); 33485#L12 assume !(main_~i~0 == 1); 33484#L12-2 assume !(main_~i~0 == 10); 33483#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33482#L18-1 assume true; 33481#L11-1 assume !!(main_~i~0 > 0); 33480#L12 assume !(main_~i~0 == 1); 33479#L12-2 assume !(main_~i~0 == 10); 33478#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33477#L18-1 assume true; 33476#L11-1 assume !!(main_~i~0 > 0); 33475#L12 assume !(main_~i~0 == 1); 33474#L12-2 assume !(main_~i~0 == 10); 33473#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33472#L18-1 assume true; 33471#L11-1 assume !!(main_~i~0 > 0); 33470#L12 assume !(main_~i~0 == 1); 33469#L12-2 assume !(main_~i~0 == 10); 33468#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33467#L18-1 assume true; 33466#L11-1 assume !!(main_~i~0 > 0); 33465#L12 assume !(main_~i~0 == 1); 33464#L12-2 assume !(main_~i~0 == 10); 33463#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33462#L18-1 assume true; 33461#L11-1 assume !!(main_~i~0 > 0); 33460#L12 assume !(main_~i~0 == 1); 33459#L12-2 assume !(main_~i~0 == 10); 33458#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33457#L18-1 assume true; 33456#L11-1 assume !!(main_~i~0 > 0); 33455#L12 assume !(main_~i~0 == 1); 33454#L12-2 assume !(main_~i~0 == 10); 33453#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33452#L18-1 assume true; 33447#L11-1 assume !!(main_~i~0 > 0); 33451#L12 assume !(main_~i~0 == 1); 33449#L12-2 assume !(main_~i~0 == 10); 33448#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33446#L18-1 assume true; 33445#L11-1 assume !!(main_~i~0 > 0); 33444#L12 assume main_~i~0 == 1;main_~up~0 := 1; 33297#L12-2 [2018-10-27 06:09:12,440 INFO L795 eck$LassoCheckResult]: Loop: 33297#L12-2 assume !(main_~i~0 == 10); 33443#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33442#L18-1 assume true; 33441#L11-1 assume !!(main_~i~0 > 0); 33440#L12 assume !(main_~i~0 == 1); 33439#L12-2 assume !(main_~i~0 == 10); 33438#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33437#L18-1 assume true; 33436#L11-1 assume !!(main_~i~0 > 0); 33435#L12 assume !(main_~i~0 == 1); 33434#L12-2 assume !(main_~i~0 == 10); 33433#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33432#L18-1 assume true; 33431#L11-1 assume !!(main_~i~0 > 0); 33430#L12 assume !(main_~i~0 == 1); 33429#L12-2 assume !(main_~i~0 == 10); 33428#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33427#L18-1 assume true; 33426#L11-1 assume !!(main_~i~0 > 0); 33425#L12 assume !(main_~i~0 == 1); 33424#L12-2 assume !(main_~i~0 == 10); 33423#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33422#L18-1 assume true; 33421#L11-1 assume !!(main_~i~0 > 0); 33420#L12 assume !(main_~i~0 == 1); 33419#L12-2 assume !(main_~i~0 == 10); 33418#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33417#L18-1 assume true; 33416#L11-1 assume !!(main_~i~0 > 0); 33415#L12 assume !(main_~i~0 == 1); 33414#L12-2 assume !(main_~i~0 == 10); 33413#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33412#L18-1 assume true; 33411#L11-1 assume !!(main_~i~0 > 0); 33410#L12 assume !(main_~i~0 == 1); 33409#L12-2 assume !(main_~i~0 == 10); 33408#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33407#L18-1 assume true; 33406#L11-1 assume !!(main_~i~0 > 0); 33405#L12 assume !(main_~i~0 == 1); 33404#L12-2 assume !(main_~i~0 == 10); 33402#L15-1 assume main_~up~0 == 1;main_~i~0 := main_~i~0 + 1; 33398#L18-1 assume true; 33399#L11-1 assume !!(main_~i~0 > 0); 33392#L12 assume !(main_~i~0 == 1); 33393#L12-2 assume main_~i~0 == 10;main_~up~0 := 0; 33307#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33383#L18-1 assume true; 33381#L11-1 assume !!(main_~i~0 > 0); 33379#L12 assume !(main_~i~0 == 1); 33377#L12-2 assume !(main_~i~0 == 10); 33375#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33373#L18-1 assume true; 33371#L11-1 assume !!(main_~i~0 > 0); 33369#L12 assume !(main_~i~0 == 1); 33367#L12-2 assume !(main_~i~0 == 10); 33365#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33363#L18-1 assume true; 33361#L11-1 assume !!(main_~i~0 > 0); 33359#L12 assume !(main_~i~0 == 1); 33357#L12-2 assume !(main_~i~0 == 10); 33355#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33353#L18-1 assume true; 33351#L11-1 assume !!(main_~i~0 > 0); 33349#L12 assume !(main_~i~0 == 1); 33347#L12-2 assume !(main_~i~0 == 10); 33345#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33343#L18-1 assume true; 33341#L11-1 assume !!(main_~i~0 > 0); 33339#L12 assume !(main_~i~0 == 1); 33337#L12-2 assume !(main_~i~0 == 10); 33335#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33333#L18-1 assume true; 33331#L11-1 assume !!(main_~i~0 > 0); 33329#L12 assume !(main_~i~0 == 1); 33327#L12-2 assume !(main_~i~0 == 10); 33325#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33323#L18-1 assume true; 33321#L11-1 assume !!(main_~i~0 > 0); 33319#L12 assume !(main_~i~0 == 1); 33317#L12-2 assume !(main_~i~0 == 10); 33315#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33313#L18-1 assume true; 33311#L11-1 assume !!(main_~i~0 > 0); 33309#L12 assume !(main_~i~0 == 1); 33299#L12-2 assume !(main_~i~0 == 10); 33305#L15-1 assume !(main_~up~0 == 1);main_~i~0 := main_~i~0 - 1; 33303#L18-1 assume true; 33301#L11-1 assume !!(main_~i~0 > 0); 33298#L12 assume main_~i~0 == 1;main_~up~0 := 1; 33297#L12-2 [2018-10-27 06:09:12,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:12,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1788875264, now seen corresponding path program 16 times [2018-10-27 06:09:12,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:12,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:12,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:12,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:12,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:12,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:12,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1133017893, now seen corresponding path program 15 times [2018-10-27 06:09:12,468 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:12,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:12,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:12,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:12,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:12,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:12,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1451920922, now seen corresponding path program 17 times [2018-10-27 06:09:12,486 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:12,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:12,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:12,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:12,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:13,270 WARN L179 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 66 [2018-10-27 06:09:13,481 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 67 [2018-10-27 06:09:13,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:09:13 BoogieIcfgContainer [2018-10-27 06:09:13,514 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:09:13,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:09:13,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:09:13,515 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:09:13,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:51" (3/4) ... [2018-10-27 06:09:13,519 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-10-27 06:09:13,574 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_10416055-ff0f-4698-993a-20902ed2188f/bin-2019/uautomizer/witness.graphml [2018-10-27 06:09:13,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:09:13,575 INFO L168 Benchmark]: Toolchain (without parser) took 22600.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.5 MB). Free memory was 953.1 MB in the beginning and 1.1 GB in the end (delta: -109.5 MB). Peak memory consumption was 160.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:13,576 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:13,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.70 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 942.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:13,576 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.76 ms. Allocated memory is still 1.0 GB. Free memory is still 942.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:13,576 INFO L168 Benchmark]: Boogie Preprocessor took 16.12 ms. Allocated memory is still 1.0 GB. Free memory was 942.3 MB in the beginning and 939.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:13,577 INFO L168 Benchmark]: RCFGBuilder took 316.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 939.6 MB in the beginning and 1.2 GB in the end (delta: -216.7 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:13,577 INFO L168 Benchmark]: BuchiAutomizer took 22014.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 86.8 MB). Peak memory consumption was 190.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:13,585 INFO L168 Benchmark]: Witness Printer took 59.99 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:13,587 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.70 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 942.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.76 ms. Allocated memory is still 1.0 GB. Free memory is still 942.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.12 ms. Allocated memory is still 1.0 GB. Free memory was 942.3 MB in the beginning and 939.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 316.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 939.6 MB in the beginning and 1.2 GB in the end (delta: -216.7 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22014.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 86.8 MB). Peak memory consumption was 190.1 MB. Max. memory is 11.5 GB. * Witness Printer took 59.99 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. 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 32 terminating modules (20 trivial, 12 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 6 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 5 locations. One deterministic module has affine ranking function i and consists of 14 locations. One deterministic module has affine ranking function i and consists of 10 locations. One deterministic module has affine ranking function i and consists of 12 locations. One deterministic module has affine ranking function i and consists of 14 locations. One deterministic module has affine ranking function i and consists of 16 locations. One deterministic module has affine ranking function i and consists of 18 locations. One deterministic module has affine ranking function i and consists of 20 locations. 20 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 376 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.9s and 23 iterations. TraceHistogramMax:19. Analysis of lassos took 14.1s. Construction of modules took 3.8s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 31. Automata minimization 0.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 994 StatesRemovedByMinimization, 30 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 376 states and ocurred in iteration 22. Nontrivial modules had stage [11, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1204/3255 HoareTripleCheckerStatistics: 360 SDtfs, 589 SDslu, 405 SDs, 0 SdLazy, 1993 SolverSat, 160 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU1 SILI8 SILT10 lasso1 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax175 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq194 hnf91 smp94 dnf122 smp97 tf110 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 6 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 21 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3542c28f=0, \result=0, i=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 Loop: [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...