./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/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 a5e4c58569d8caa47946d30f6cb501096837aef1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 04:45:27,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:45:27,721 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:45:27,729 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:45:27,729 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:45:27,730 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:45:27,731 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:45:27,732 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:45:27,733 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:45:27,734 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:45:27,734 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:45:27,735 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:45:27,735 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:45:27,736 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:45:27,736 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:45:27,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:45:27,738 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:45:27,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:45:27,740 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:45:27,741 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:45:27,742 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:45:27,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:45:27,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:45:27,744 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:45:27,744 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:45:27,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:45:27,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:45:27,746 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:45:27,747 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:45:27,748 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:45:27,748 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:45:27,748 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:45:27,748 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:45:27,748 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:45:27,749 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:45:27,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:45:27,749 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 04:45:27,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:45:27,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:45:27,761 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 04:45:27,761 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 04:45:27,762 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 04:45:27,762 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 04:45:27,762 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 04:45:27,762 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 04:45:27,762 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 04:45:27,762 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 04:45:27,762 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 04:45:27,763 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:45:27,763 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 04:45:27,763 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:45:27,763 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:45:27,763 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 04:45:27,763 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 04:45:27,763 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 04:45:27,763 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:45:27,763 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 04:45:27,764 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 04:45:27,764 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 04:45:27,764 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:45:27,764 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:45:27,764 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 04:45:27,764 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:45:27,764 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 04:45:27,764 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 04:45:27,765 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 04:45:27,765 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_57a6146e-09b4-4b92-9bf5-13781bb5b212/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 -> a5e4c58569d8caa47946d30f6cb501096837aef1 [2018-12-02 04:45:27,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:45:27,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:45:27,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:45:27,795 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:45:27,795 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:45:27,796 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2018-12-02 04:45:27,833 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/data/fc3448741/515b83f8f0164a80b37ec53e1d8fc71b/FLAG2014f8330 [2018-12-02 04:45:28,258 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:45:28,258 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2018-12-02 04:45:28,261 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/data/fc3448741/515b83f8f0164a80b37ec53e1d8fc71b/FLAG2014f8330 [2018-12-02 04:45:28,269 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/data/fc3448741/515b83f8f0164a80b37ec53e1d8fc71b [2018-12-02 04:45:28,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:45:28,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:45:28,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:45:28,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:45:28,274 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:45:28,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:45:28" (1/1) ... [2018-12-02 04:45:28,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b10c34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28, skipping insertion in model container [2018-12-02 04:45:28,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:45:28" (1/1) ... [2018-12-02 04:45:28,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:45:28,290 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:45:28,371 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:45:28,373 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:45:28,381 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:45:28,389 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:45:28,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28 WrapperNode [2018-12-02 04:45:28,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:45:28,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:45:28,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:45:28,390 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:45:28,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28" (1/1) ... [2018-12-02 04:45:28,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28" (1/1) ... [2018-12-02 04:45:28,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:45:28,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:45:28,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:45:28,409 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:45:28,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28" (1/1) ... [2018-12-02 04:45:28,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28" (1/1) ... [2018-12-02 04:45:28,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28" (1/1) ... [2018-12-02 04:45:28,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28" (1/1) ... [2018-12-02 04:45:28,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28" (1/1) ... [2018-12-02 04:45:28,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28" (1/1) ... [2018-12-02 04:45:28,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28" (1/1) ... [2018-12-02 04:45:28,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:45:28,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:45:28,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:45:28,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:45:28,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:45:28,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:45:28,561 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:45:28,561 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-02 04:45:28,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:45:28 BoogieIcfgContainer [2018-12-02 04:45:28,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:45:28,562 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 04:45:28,562 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 04:45:28,564 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 04:45:28,565 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 04:45:28,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 04:45:28" (1/3) ... [2018-12-02 04:45:28,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@544d3ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 04:45:28, skipping insertion in model container [2018-12-02 04:45:28,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 04:45:28,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:45:28" (2/3) ... [2018-12-02 04:45:28,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@544d3ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 04:45:28, skipping insertion in model container [2018-12-02 04:45:28,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 04:45:28,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:45:28" (3/3) ... [2018-12-02 04:45:28,567 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative_true-termination_true-no-overflow.c [2018-12-02 04:45:28,610 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 04:45:28,610 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 04:45:28,610 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 04:45:28,610 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 04:45:28,611 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:45:28,611 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:45:28,611 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 04:45:28,611 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:45:28,611 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 04:45:28,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-12-02 04:45:28,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 04:45:28,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:28,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:28,635 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-02 04:45:28,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 04:45:28,635 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 04:45:28,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-12-02 04:45:28,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 04:45:28,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:28,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:28,636 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-02 04:45:28,636 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 04:45:28,640 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 3#L12-2true [2018-12-02 04:45:28,641 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~c~0 > 0); 6#L12true assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3#L12-2true [2018-12-02 04:45:28,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:28,644 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-12-02 04:45:28,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:28,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:28,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:28,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:45:28,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:28,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2018-12-02 04:45:28,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:28,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:28,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:28,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:45:28,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:28,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2018-12-02 04:45:28,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:28,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:28,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:45:28,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:28,758 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:28,758 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:28,759 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:28,759 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:28,759 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 04:45:28,759 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:28,759 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:28,759 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:28,759 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2018-12-02 04:45:28,759 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:28,759 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:28,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:28,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-12-02 04:45:28,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:28,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:28,849 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:28,850 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:28,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:28,854 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:28,873 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:28,873 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:28,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:28,876 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:28,891 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:28,891 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:28,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:28,893 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:28,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:28,910 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:28,927 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 04:45:28,928 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:28,928 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:28,928 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:28,928 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:28,928 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:45:28,928 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:28,928 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:28,928 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:28,928 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2018-12-02 04:45:28,928 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:28,928 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:28,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:28,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-12-02 04:45:28,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-12-02 04:45:28,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:28,983 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:28,987 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:45:28,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:28,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:28,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:28,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:28,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:28,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:45:28,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:45:28,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:45:28,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:29,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:29,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:29,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:29,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:29,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:45:29,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:45:29,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:45:29,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:29,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:29,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:29,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:29,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:29,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:29,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:29,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:29,013 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:45:29,016 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:45:29,016 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:45:29,017 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:45:29,017 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 04:45:29,017 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:45:29,017 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-02 04:45:29,018 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 04:45:29,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:29,057 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-12-02 04:45:29,058 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2018-12-02 04:45:29,083 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2018-12-02 04:45:29,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 04:45:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-02 04:45:29,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2018-12-02 04:45:29,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-02 04:45:29,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2018-12-02 04:45:29,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-12-02 04:45:29,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 04:45:29,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2018-12-02 04:45:29,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-12-02 04:45:29,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-12-02 04:45:29,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2018-12-02 04:45:29,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:29,094 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-12-02 04:45:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2018-12-02 04:45:29,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-02 04:45:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:45:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-02 04:45:29,110 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-12-02 04:45:29,110 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-12-02 04:45:29,110 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 04:45:29,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2018-12-02 04:45:29,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 04:45:29,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:29,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:29,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 04:45:29,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 04:45:29,111 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 69#L12-2 assume !!(main_~c~0 > 0); 67#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 63#L12-2 [2018-12-02 04:45:29,111 INFO L796 eck$LassoCheckResult]: Loop: 63#L12-2 assume !!(main_~c~0 > 0); 64#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 63#L12-2 [2018-12-02 04:45:29,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,111 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-12-02 04:45:29,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:29,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:29,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:45:29,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2018-12-02 04:45:29,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:29,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:29,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:45:29,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,124 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2018-12-02 04:45:29,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:29,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,153 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:29,154 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:29,154 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:29,154 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:29,154 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 04:45:29,154 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,154 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:29,154 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:29,154 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2018-12-02 04:45:29,154 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:29,154 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:29,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,190 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:29,190 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,202 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:29,202 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:29,217 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:29,217 INFO L448 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_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:29,220 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,236 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:29,236 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:29,252 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 04:45:29,253 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:29,253 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:29,253 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:29,253 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:29,253 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:45:29,253 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,253 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:29,253 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:29,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2018-12-02 04:45:29,254 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:29,254 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:29,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,293 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:29,294 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:45:29,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:29,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:29,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:29,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:29,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:29,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:45:29,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:45:29,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:45:29,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:29,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:29,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:29,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:29,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:29,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:29,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:29,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:29,302 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:45:29,304 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:45:29,304 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:45:29,304 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:45:29,304 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 04:45:29,305 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:45:29,305 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-12-02 04:45:29,305 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 04:45:29,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:29,327 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 04:45:29,327 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 04:45:29,335 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2018-12-02 04:45:29,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 04:45:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-12-02 04:45:29,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-02 04:45:29,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-02 04:45:29,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-02 04:45:29,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2018-12-02 04:45:29,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 04:45:29,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2018-12-02 04:45:29,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 04:45:29,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 04:45:29,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2018-12-02 04:45:29,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:29,338 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-02 04:45:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2018-12-02 04:45:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-02 04:45:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-02 04:45:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-12-02 04:45:29,339 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-02 04:45:29,339 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-02 04:45:29,339 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 04:45:29,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-12-02 04:45:29,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 04:45:29,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:29,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:29,340 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-02 04:45:29,340 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 04:45:29,340 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 123#L12-2 assume !!(main_~c~0 > 0); 121#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 124#L12-2 assume !!(main_~c~0 > 0); 125#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 117#L12-2 [2018-12-02 04:45:29,340 INFO L796 eck$LassoCheckResult]: Loop: 117#L12-2 assume !!(main_~c~0 > 0); 118#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 117#L12-2 [2018-12-02 04:45:29,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2018-12-02 04:45:29,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:29,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:29,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:45:29,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2018-12-02 04:45:29,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:29,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:29,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:29,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2018-12-02 04:45:29,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:29,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,372 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:29,372 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:29,373 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:29,373 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:29,373 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 04:45:29,373 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,373 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:29,373 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:29,373 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2018-12-02 04:45:29,373 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:29,373 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:29,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,421 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:29,421 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,423 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:29,423 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:29,439 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:29,455 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 04:45:29,456 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:29,456 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:29,456 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:29,456 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:29,456 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:45:29,456 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:29,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:29,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2018-12-02 04:45:29,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:29,457 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:29,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,493 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:29,493 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:45:29,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:29,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:29,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:29,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:29,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:29,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:29,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:29,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:29,497 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:45:29,498 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:45:29,498 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:45:29,499 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:45:29,499 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 04:45:29,499 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:45:29,499 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-02 04:45:29,499 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 04:45:29,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:29,514 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-12-02 04:45:29,514 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 04:45:29,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2018-12-02 04:45:29,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 04:45:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-12-02 04:45:29,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-02 04:45:29,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,520 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:29,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:29,534 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-12-02 04:45:29,534 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 04:45:29,539 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2018-12-02 04:45:29,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 04:45:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-12-02 04:45:29,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-02 04:45:29,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,540 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:29,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:29,555 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-12-02 04:45:29,555 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 04:45:29,560 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2018-12-02 04:45:29,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 04:45:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-02 04:45:29,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-02 04:45:29,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-02 04:45:29,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-02 04:45:29,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2018-12-02 04:45:29,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 04:45:29,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2018-12-02 04:45:29,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-02 04:45:29,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 04:45:29,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2018-12-02 04:45:29,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:29,563 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-12-02 04:45:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2018-12-02 04:45:29,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2018-12-02 04:45:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 04:45:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-12-02 04:45:29,564 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-12-02 04:45:29,564 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-12-02 04:45:29,564 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 04:45:29,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2018-12-02 04:45:29,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 04:45:29,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:29,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:29,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-02 04:45:29,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 04:45:29,565 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 261#L12-2 [2018-12-02 04:45:29,565 INFO L796 eck$LassoCheckResult]: Loop: 261#L12-2 assume !!(main_~c~0 > 0); 263#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 261#L12-2 [2018-12-02 04:45:29,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,565 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-12-02 04:45:29,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:29,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2018-12-02 04:45:29,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:29,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:29,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:29,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,572 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2018-12-02 04:45:29,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:29,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:29,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:45:29,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,585 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:29,585 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:29,585 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:29,585 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:29,585 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 04:45:29,585 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,585 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:29,585 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:29,586 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2018-12-02 04:45:29,586 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:29,586 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:29,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-12-02 04:45:29,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,622 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:29,622 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,624 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:29,624 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:29,642 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:29,642 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:29,644 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/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-12-02 04:45:29,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:29,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:29,666 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:29,666 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:29,681 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:29,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:29,695 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:29,698 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/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-12-02 04:45:29,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:29,713 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:29,729 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 04:45:29,730 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:29,730 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:29,730 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:29,730 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:29,730 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:45:29,730 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,730 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:29,730 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:29,730 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2018-12-02 04:45:29,730 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:29,730 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:29,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,770 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:29,770 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:45:29,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:29,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:29,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:29,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:29,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:29,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:29,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:29,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:29,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:45:29,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:29,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:29,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:29,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:29,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:29,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:45:29,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:45:29,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:45:29,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-12-02 04:45:29,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:29,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:29,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:29,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:29,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:45:29,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:45:29,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:45:29,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:29,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:29,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:29,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:29,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:29,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:29,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:29,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:29,784 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:45:29,786 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:45:29,786 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 04:45:29,786 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:45:29,786 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 04:45:29,786 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:45:29,786 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2018-12-02 04:45:29,787 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 04:45:29,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:29,803 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-12-02 04:45:29,803 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-02 04:45:29,807 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2018-12-02 04:45:29,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 04:45:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2018-12-02 04:45:29,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2018-12-02 04:45:29,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-02 04:45:29,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2018-12-02 04:45:29,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:29,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2018-12-02 04:45:29,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 04:45:29,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2018-12-02 04:45:29,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-12-02 04:45:29,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-12-02 04:45:29,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2018-12-02 04:45:29,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:29,809 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-12-02 04:45:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2018-12-02 04:45:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-02 04:45:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 04:45:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-12-02 04:45:29,810 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-12-02 04:45:29,810 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-12-02 04:45:29,810 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 04:45:29,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2018-12-02 04:45:29,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 04:45:29,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:29,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:29,811 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2018-12-02 04:45:29,812 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 04:45:29,812 INFO L794 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 306#L12-2 assume !!(main_~c~0 > 0); 307#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 313#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2018-12-02 04:45:29,812 INFO L796 eck$LassoCheckResult]: Loop: 311#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 312#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2018-12-02 04:45:29,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,812 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2018-12-02 04:45:29,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:29,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:29,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:29,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:29,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:45:29,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:45:29,834 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:45:29,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:29,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2018-12-02 04:45:29,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:29,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:29,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:29,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:29,850 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:29,850 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:29,850 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:29,850 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:29,850 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 04:45:29,850 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,850 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:29,850 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:29,850 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2018-12-02 04:45:29,850 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:29,851 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:29,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:29,887 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:29,888 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:29,891 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:29,917 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:29,944 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:29,944 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=1}] Lambdas: [3, 12, 1] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:29,958 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,975 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:29,975 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:29,992 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 04:45:29,993 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:29,993 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:29,993 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:29,993 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:29,993 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:45:29,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:29,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:29,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:29,993 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2018-12-02 04:45:29,994 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:29,994 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:29,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-12-02 04:45:30,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,048 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:30,048 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:45:30,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-12-02 04:45:30,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:30,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:30,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:30,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:30,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:30,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:30,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:30,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:45:30,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:30,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:30,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:30,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:30,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:30,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:45:30,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:45:30,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:45:30,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:30,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:30,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:30,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:30,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:30,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:30,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:30,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:30,056 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:45:30,057 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:45:30,057 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 04:45:30,058 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:45:30,058 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 04:45:30,058 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:45:30,058 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2018-12-02 04:45:30,058 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 04:45:30,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:30,087 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 04:45:30,088 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 04:45:30,092 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2018-12-02 04:45:30,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 04:45:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-12-02 04:45:30,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-02 04:45:30,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,092 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:30,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:30,118 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 04:45:30,118 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 04:45:30,128 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2018-12-02 04:45:30,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 04:45:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-02 04:45:30,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-02 04:45:30,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,129 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:30,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:30,153 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 04:45:30,153 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 04:45:30,157 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2018-12-02 04:45:30,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 04:45:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-12-02 04:45:30,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-02 04:45:30,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-02 04:45:30,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-02 04:45:30,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-12-02 04:45:30,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:45:30,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2018-12-02 04:45:30,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-12-02 04:45:30,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-12-02 04:45:30,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-12-02 04:45:30,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:30,161 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-02 04:45:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-12-02 04:45:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2018-12-02 04:45:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:45:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-02 04:45:30,162 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-12-02 04:45:30,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:45:30,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:45:30,165 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2018-12-02 04:45:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:45:30,176 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-12-02 04:45:30,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:45:30,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2018-12-02 04:45:30,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 04:45:30,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2018-12-02 04:45:30,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-12-02 04:45:30,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-12-02 04:45:30,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-12-02 04:45:30,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:30,177 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-02 04:45:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-12-02 04:45:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-12-02 04:45:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:45:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-02 04:45:30,178 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-02 04:45:30,178 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-02 04:45:30,178 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 04:45:30,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-12-02 04:45:30,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 04:45:30,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:30,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:30,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2018-12-02 04:45:30,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-12-02 04:45:30,178 INFO L794 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 456#L12-2 assume !!(main_~c~0 > 0); 457#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2018-12-02 04:45:30,178 INFO L796 eck$LassoCheckResult]: Loop: 461#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2018-12-02 04:45:30,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2018-12-02 04:45:30,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:30,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:30,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2018-12-02 04:45:30,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:30,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:30,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2018-12-02 04:45:30,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:30,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:30,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:45:30,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:30,219 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:30,219 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:30,219 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:30,219 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:30,219 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 04:45:30,219 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:30,219 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:30,219 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:30,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2018-12-02 04:45:30,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:30,219 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:30,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,254 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:30,254 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:30,255 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:30,255 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:30,269 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:30,270 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:30,272 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:30,272 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:30,286 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:30,286 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:30,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:30,289 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:30,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:30,305 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:30,307 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 04:45:30,320 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:30,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:30,320 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:30,320 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:30,320 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:45:30,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:30,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:30,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:30,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2018-12-02 04:45:30,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:30,320 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:30,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,357 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:30,357 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:45:30,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:30,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:30,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:30,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:30,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:30,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:30,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:30,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:30,360 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:45:30,361 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:45:30,361 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 04:45:30,361 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:45:30,361 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 04:45:30,361 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:45:30,361 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 201 Supporting invariants [] [2018-12-02 04:45:30,361 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 04:45:30,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:30,397 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-12-02 04:45:30,397 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-02 04:45:30,401 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2018-12-02 04:45:30,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 04:45:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-12-02 04:45:30,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 04:45:30,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,402 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:30,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:30,430 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-12-02 04:45:30,430 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-02 04:45:30,440 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 11 states and 14 transitions. Complement of second has 5 states. [2018-12-02 04:45:30,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 04:45:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-02 04:45:30,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 04:45:30,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,441 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:30,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:30,468 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 04:45:30,468 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-02 04:45:30,473 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2018-12-02 04:45:30,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 04:45:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-12-02 04:45:30,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 04:45:30,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,475 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:30,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:30,505 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 04:45:30,506 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-02 04:45:30,516 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 18 transitions. Complement of second has 4 states. [2018-12-02 04:45:30,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 04:45:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-02 04:45:30,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 04:45:30,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,517 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:30,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:30,542 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 04:45:30,543 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-02 04:45:30,577 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. Result 72 states and 96 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2018-12-02 04:45:30,577 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-12-02 04:45:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 04:45:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-12-02 04:45:30,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 04:45:30,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-02 04:45:30,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-02 04:45:30,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2018-12-02 04:45:30,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-02 04:45:30,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2018-12-02 04:45:30,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-12-02 04:45:30,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2018-12-02 04:45:30,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2018-12-02 04:45:30,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:30,584 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2018-12-02 04:45:30,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2018-12-02 04:45:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2018-12-02 04:45:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 04:45:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-12-02 04:45:30,587 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-12-02 04:45:30,587 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-12-02 04:45:30,587 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 04:45:30,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2018-12-02 04:45:30,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 04:45:30,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:30,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:30,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2018-12-02 04:45:30,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2018-12-02 04:45:30,588 INFO L794 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 823#L12-2 assume !!(main_~c~0 > 0); 826#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2018-12-02 04:45:30,588 INFO L796 eck$LassoCheckResult]: Loop: 824#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2018-12-02 04:45:30,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,588 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2018-12-02 04:45:30,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:30,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:30,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:30,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 04:45:30,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:45:30,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/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-12-02 04:45:30,629 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 04:45:30,634 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-02 04:45:30,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:45:30,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 04:45:30,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:45:30,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-12-02 04:45:30,654 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:45:30,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2018-12-02 04:45:30,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:30,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:30,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:30,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:30,698 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:30,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:30,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:30,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:30,698 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 04:45:30,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:30,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:30,698 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:30,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2018-12-02 04:45:30,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:30,698 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:30,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,739 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:30,739 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:30,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:30,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:30,764 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:30,764 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:30,768 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:30,768 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:30,782 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:30,782 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:30,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:30,786 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:30,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:30,802 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:30,842 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 04:45:30,843 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:30,843 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:30,843 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:30,844 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:30,844 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:45:30,844 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:30,844 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:30,844 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:30,844 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2018-12-02 04:45:30,844 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:30,844 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:30,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:30,881 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:30,881 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:45:30,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-12-02 04:45:30,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:30,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:30,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:30,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:30,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:45:30,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:45:30,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:45:30,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:30,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:30,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:30,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:30,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:30,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:45:30,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:45:30,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:45:30,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:30,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:30,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:30,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:30,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:30,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:30,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:30,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:30,889 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:45:30,890 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:45:30,890 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:45:30,891 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:45:30,891 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 04:45:30,891 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:45:30,891 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-12-02 04:45:30,891 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 04:45:30,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 04:45:30,927 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-12-02 04:45:30,927 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-02 04:45:30,943 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 61 states and 87 transitions. Complement of second has 9 states. [2018-12-02 04:45:30,943 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-12-02 04:45:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 04:45:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-02 04:45:30,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-02 04:45:30,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-02 04:45:30,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2018-12-02 04:45:30,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:30,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2018-12-02 04:45:30,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 04:45:30,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 52 states and 75 transitions. [2018-12-02 04:45:30,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-12-02 04:45:30,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-12-02 04:45:30,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 75 transitions. [2018-12-02 04:45:30,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:30,945 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2018-12-02 04:45:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 75 transitions. [2018-12-02 04:45:30,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-12-02 04:45:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 04:45:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2018-12-02 04:45:30,947 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2018-12-02 04:45:30,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:45:30,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:45:30,947 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2018-12-02 04:45:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:45:30,956 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-12-02 04:45:30,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:45:30,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2018-12-02 04:45:30,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 04:45:30,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 36 transitions. [2018-12-02 04:45:30,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-12-02 04:45:30,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2018-12-02 04:45:30,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-12-02 04:45:30,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:30,958 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-12-02 04:45:30,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-12-02 04:45:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-12-02 04:45:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 04:45:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-12-02 04:45:30,959 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-02 04:45:30,959 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-02 04:45:30,959 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 04:45:30,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-12-02 04:45:30,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 04:45:30,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:30,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:30,959 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2018-12-02 04:45:30,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2018-12-02 04:45:30,960 INFO L794 eck$LassoCheckResult]: Stem: 1076#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1077#L12-2 assume !!(main_~c~0 > 0); 1093#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1091#L12-2 assume !!(main_~c~0 > 0); 1084#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2018-12-02 04:45:30,960 INFO L796 eck$LassoCheckResult]: Loop: 1078#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2018-12-02 04:45:30,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2018-12-02 04:45:30,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:30,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:30,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:30,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:30,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2018-12-02 04:45:30,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:30,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:30,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:30,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:30,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:30,969 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2018-12-02 04:45:30,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:30,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:30,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:30,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 04:45:30,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:45:30,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/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-12-02 04:45:31,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:45:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 04:45:31,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:45:31,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 04:45:31,056 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:31,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:31,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:31,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:31,056 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 04:45:31,056 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:31,056 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:31,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:31,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration8_Loop [2018-12-02 04:45:31,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:31,056 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:31,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,094 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:31,094 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:31,096 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:31,096 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:31,110 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:31,110 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:31,114 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:31,114 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:31,131 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:31,131 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:31,133 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 04:45:31,146 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:31,146 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:31,146 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:31,146 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:31,147 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:45:31,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:31,147 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:31,147 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:31,147 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration8_Loop [2018-12-02 04:45:31,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:31,147 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:31,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,182 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:31,182 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:45:31,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:31,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:31,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:31,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:31,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:31,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:45:31,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:45:31,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:45:31,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:31,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:31,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:31,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:31,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:31,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:31,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:31,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:31,186 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:45:31,187 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:45:31,187 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:45:31,187 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:45:31,188 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 04:45:31,188 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:45:31,188 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-02 04:45:31,188 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 04:45:31,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:31,234 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 04:45:31,234 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-02 04:45:31,252 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2018-12-02 04:45:31,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 04:45:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-12-02 04:45:31,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-02 04:45:31,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:31,253 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:31,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:31,291 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 04:45:31,291 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-02 04:45:31,302 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2018-12-02 04:45:31,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 04:45:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-12-02 04:45:31,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-02 04:45:31,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:31,302 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:31,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:31,337 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 04:45:31,337 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-02 04:45:31,354 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 75 states and 99 transitions. Complement of second has 13 states. [2018-12-02 04:45:31,354 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-12-02 04:45:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 04:45:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-12-02 04:45:31,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-02 04:45:31,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:31,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2018-12-02 04:45:31,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:31,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2018-12-02 04:45:31,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:31,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2018-12-02 04:45:31,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-12-02 04:45:31,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2018-12-02 04:45:31,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-12-02 04:45:31,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-12-02 04:45:31,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2018-12-02 04:45:31,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:31,359 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-12-02 04:45:31,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2018-12-02 04:45:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-12-02 04:45:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 04:45:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2018-12-02 04:45:31,362 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2018-12-02 04:45:31,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:45:31,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:45:31,362 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 7 states. [2018-12-02 04:45:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:45:31,378 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2018-12-02 04:45:31,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:45:31,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2018-12-02 04:45:31,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-12-02 04:45:31,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 67 transitions. [2018-12-02 04:45:31,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-12-02 04:45:31,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 04:45:31,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2018-12-02 04:45:31,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:31,379 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2018-12-02 04:45:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2018-12-02 04:45:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2018-12-02 04:45:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 04:45:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-12-02 04:45:31,381 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-12-02 04:45:31,381 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-12-02 04:45:31,381 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 04:45:31,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2018-12-02 04:45:31,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-02 04:45:31,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:31,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:31,382 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-02 04:45:31,382 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2018-12-02 04:45:31,382 INFO L794 eck$LassoCheckResult]: Stem: 1621#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1623#L12-2 assume !!(main_~c~0 > 0); 1637#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1632#L12-2 assume !!(main_~c~0 > 0); 1628#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1629#L12-2 [2018-12-02 04:45:31,382 INFO L796 eck$LassoCheckResult]: Loop: 1629#L12-2 assume !!(main_~c~0 > 0); 1626#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1627#L12-2 assume !!(main_~c~0 > 0); 1631#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1617#L12-2 assume !!(main_~c~0 > 0); 1618#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1624#L12-2 assume !!(main_~c~0 > 0); 1628#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1629#L12-2 [2018-12-02 04:45:31,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,382 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2018-12-02 04:45:31,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:31,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:31,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:45:31,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2018-12-02 04:45:31,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:31,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 04:45:31,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:45:31,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:45:31,402 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 04:45:31,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:45:31,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:45:31,403 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-12-02 04:45:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:45:31,409 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-12-02 04:45:31,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:45:31,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2018-12-02 04:45:31,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-02 04:45:31,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2018-12-02 04:45:31,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 04:45:31,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 04:45:31,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2018-12-02 04:45:31,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:31,411 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-12-02 04:45:31,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2018-12-02 04:45:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-12-02 04:45:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 04:45:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-12-02 04:45:31,413 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-02 04:45:31,413 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-02 04:45:31,413 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 04:45:31,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2018-12-02 04:45:31,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-02 04:45:31,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:31,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:31,414 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-02 04:45:31,414 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2018-12-02 04:45:31,414 INFO L794 eck$LassoCheckResult]: Stem: 1712#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1714#L12-2 assume !!(main_~c~0 > 0); 1728#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1723#L12-2 assume !!(main_~c~0 > 0); 1719#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1708#L12-2 [2018-12-02 04:45:31,415 INFO L796 eck$LassoCheckResult]: Loop: 1708#L12-2 assume !!(main_~c~0 > 0); 1709#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1718#L12-2 assume !!(main_~c~0 > 0); 1724#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1722#L12-2 assume !!(main_~c~0 > 0); 1715#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1716#L12-2 assume !!(main_~c~0 > 0); 1727#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1725#L12-2 assume !!(main_~c~0 > 0); 1721#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1708#L12-2 [2018-12-02 04:45:31,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,415 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2018-12-02 04:45:31,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:31,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:31,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:31,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2018-12-02 04:45:31,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:31,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:31,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:31,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,426 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2018-12-02 04:45:31,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:31,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:31,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:31,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,481 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:31,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:31,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:31,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:31,481 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 04:45:31,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:31,482 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:31,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:31,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2018-12-02 04:45:31,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:31,482 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:31,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,517 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:31,518 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:31,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:31,519 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:31,534 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 04:45:31,534 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:31,538 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:31,538 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:31,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:31,554 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:31,570 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 04:45:31,571 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:31,571 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:31,572 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:31,572 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:31,572 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:45:31,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:31,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:31,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:31,572 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2018-12-02 04:45:31,572 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:31,572 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:31,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:31,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-12-02 04:45:31,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-12-02 04:45:31,614 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:31,614 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:45:31,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:31,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:31,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:31,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:31,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:31,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:45:31,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:45:31,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:45:31,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:31,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:31,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:31,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:31,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:31,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:31,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:31,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:31,620 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:45:31,621 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:45:31,621 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:45:31,621 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:45:31,622 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 04:45:31,622 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:45:31,622 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-02 04:45:31,622 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 04:45:31,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:31,665 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-02 04:45:31,666 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-02 04:45:31,668 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2018-12-02 04:45:31,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:45:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-02 04:45:31,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-02 04:45:31,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:31,669 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:31,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:31,732 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-02 04:45:31,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-02 04:45:31,735 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2018-12-02 04:45:31,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:45:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-02 04:45:31,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-02 04:45:31,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:31,736 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:31,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:31,781 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-02 04:45:31,781 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-02 04:45:31,786 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 46 states and 60 transitions. Complement of second has 4 states. [2018-12-02 04:45:31,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:45:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-02 04:45:31,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-02 04:45:31,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:31,787 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:31,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:31,846 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-02 04:45:31,846 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-02 04:45:31,864 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 63 states and 75 transitions. Complement of second has 8 states. [2018-12-02 04:45:31,864 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-12-02 04:45:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:45:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-12-02 04:45:31,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-02 04:45:31,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:31,865 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:31,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:31,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:31,912 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-02 04:45:31,912 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-02 04:45:31,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,937 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,937 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,938 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,957 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:31,964 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. Result 404 states and 547 transitions. Complement of second has 85 states 12 powerset states73 rank states. The highest rank that occured is 7 [2018-12-02 04:45:31,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:45:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-12-02 04:45:31,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-02 04:45:31,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:31,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2018-12-02 04:45:31,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:31,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2018-12-02 04:45:31,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:31,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2018-12-02 04:45:31,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-12-02 04:45:31,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2018-12-02 04:45:31,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-02 04:45:31,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 04:45:31,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2018-12-02 04:45:31,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:31,973 INFO L705 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2018-12-02 04:45:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2018-12-02 04:45:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2018-12-02 04:45:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 04:45:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2018-12-02 04:45:31,976 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2018-12-02 04:45:31,976 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2018-12-02 04:45:31,976 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 04:45:31,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2018-12-02 04:45:31,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-12-02 04:45:31,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:31,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:31,976 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-02 04:45:31,976 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2018-12-02 04:45:31,976 INFO L794 eck$LassoCheckResult]: Stem: 2705#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 2708#L12-2 assume !!(main_~c~0 > 0); 2733#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2725#L12-2 assume !!(main_~c~0 > 0); 2713#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2701#L12-2 [2018-12-02 04:45:31,977 INFO L796 eck$LassoCheckResult]: Loop: 2701#L12-2 assume !!(main_~c~0 > 0); 2702#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2762#L12-2 assume !!(main_~c~0 > 0); 2756#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2754#L12-2 assume !!(main_~c~0 > 0); 2748#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2747#L12-2 assume !!(main_~c~0 > 0); 2746#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2738#L12-2 assume !!(main_~c~0 > 0); 2717#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2730#L12-2 assume !!(main_~c~0 > 0); 2728#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2727#L12-2 assume !!(main_~c~0 > 0); 2715#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2701#L12-2 [2018-12-02 04:45:31,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,977 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2018-12-02 04:45:31,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:31,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2018-12-02 04:45:31,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:31,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:31,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:31,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2018-12-02 04:45:31,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:31,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:31,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:31,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:32,055 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:32,055 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:32,055 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:32,055 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:32,055 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 04:45:32,055 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:32,055 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:32,055 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:32,055 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration11_Loop [2018-12-02 04:45:32,055 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:32,056 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:32,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,092 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:32,092 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:32,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:32,095 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:32,111 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:32,111 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:32,114 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 04:45:32,127 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:32,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:32,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:32,127 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:32,127 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:45:32,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:32,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:32,127 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:32,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration11_Loop [2018-12-02 04:45:32,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:32,127 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:32,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,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-12-02 04:45:32,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,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-12-02 04:45:32,164 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:32,164 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:45:32,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:32,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:32,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:32,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:32,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:32,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:32,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:32,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:32,167 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:45:32,168 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:45:32,168 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:45:32,168 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:45:32,168 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 04:45:32,169 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:45:32,169 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-02 04:45:32,169 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 04:45:32,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:32,218 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-12-02 04:45:32,218 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-02 04:45:32,221 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2018-12-02 04:45:32,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 04:45:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-02 04:45:32,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-02 04:45:32,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:32,221 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:32,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:32,279 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2018-12-02 04:45:32,279 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-02 04:45:32,282 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2018-12-02 04:45:32,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 04:45:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-02 04:45:32,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-02 04:45:32,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:32,283 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:32,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:32,328 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-12-02 04:45:32,328 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-02 04:45:32,332 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 146 states and 191 transitions. Complement of second has 4 states. [2018-12-02 04:45:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 04:45:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-02 04:45:32,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-02 04:45:32,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:32,333 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:32,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:32,380 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2018-12-02 04:45:32,380 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-02 04:45:32,397 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 172 states and 219 transitions. Complement of second has 8 states. [2018-12-02 04:45:32,397 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-12-02 04:45:32,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 04:45:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-12-02 04:45:32,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-02 04:45:32,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:32,398 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:32,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:45:32,446 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-12-02 04:45:32,446 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-02 04:45:32,490 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,491 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,491 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,491 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,491 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,491 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,492 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,492 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,493 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,493 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,494 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,495 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,527 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,527 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,529 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,529 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,529 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,530 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,530 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,530 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,530 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,531 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,531 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,531 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,531 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,556 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,556 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,557 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,557 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,557 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,557 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,557 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,557 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,558 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,558 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,558 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,558 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,558 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,558 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,559 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,559 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,559 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,559 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,559 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,561 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,561 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,562 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,562 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,562 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,562 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,564 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-02 04:45:32,578 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. Result 1787 states and 2714 transitions. Complement of second has 144 states 16 powerset states128 rank states. The highest rank that occured is 7 [2018-12-02 04:45:32,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 04:45:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2018-12-02 04:45:32,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-02 04:45:32,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:32,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2018-12-02 04:45:32,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:32,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2018-12-02 04:45:32,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:32,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2018-12-02 04:45:32,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-12-02 04:45:32,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2018-12-02 04:45:32,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 04:45:32,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-02 04:45:32,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2018-12-02 04:45:32,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:45:32,591 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2018-12-02 04:45:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2018-12-02 04:45:32,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2018-12-02 04:45:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:45:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2018-12-02 04:45:32,601 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2018-12-02 04:45:32,601 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2018-12-02 04:45:32,602 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 04:45:32,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2018-12-02 04:45:32,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-12-02 04:45:32,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:45:32,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:45:32,603 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-02 04:45:32,603 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2018-12-02 04:45:32,604 INFO L794 eck$LassoCheckResult]: Stem: 5618#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 5623#L12-2 assume !!(main_~c~0 > 0); 5681#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5633#L12-2 assume !!(main_~c~0 > 0); 5630#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5614#L12-2 [2018-12-02 04:45:32,604 INFO L796 eck$LassoCheckResult]: Loop: 5614#L12-2 assume !!(main_~c~0 > 0); 5615#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5831#L12-2 assume !!(main_~c~0 > 0); 5761#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5759#L12-2 assume !!(main_~c~0 > 0); 5757#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5755#L12-2 assume !!(main_~c~0 > 0); 5751#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5752#L12-2 assume !!(main_~c~0 > 0); 5734#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5735#L12-2 assume !!(main_~c~0 > 0); 5731#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5732#L12-2 assume !!(main_~c~0 > 0); 5635#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5657#L12-2 assume !!(main_~c~0 > 0); 5636#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5634#L12-2 assume !!(main_~c~0 > 0); 5632#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5614#L12-2 [2018-12-02 04:45:32,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:32,604 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2018-12-02 04:45:32,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:32,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:32,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:32,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:45:32,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:32,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:32,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2018-12-02 04:45:32,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:32,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:32,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:32,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:45:32,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:32,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:32,614 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2018-12-02 04:45:32,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:45:32,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:45:32,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:32,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:45:32,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:45:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:45:32,744 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2018-12-02 04:45:32,751 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:32,751 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:32,751 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:32,751 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:32,751 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 04:45:32,751 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:32,751 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:32,751 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:32,751 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration12_Loop [2018-12-02 04:45:32,751 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:32,751 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:32,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,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-12-02 04:45:32,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,782 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:32,782 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/bin-2019/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:32,783 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 04:45:32,784 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a6146e-09b4-4b92-9bf5-13781bb5b212/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) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:32,800 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 04:45:32,800 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 04:45:32,840 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 04:45:32,841 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:45:32,841 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:45:32,841 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:45:32,841 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:45:32,841 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:45:32,841 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:45:32,841 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:45:32,841 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:45:32,842 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration12_Loop [2018-12-02 04:45:32,842 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:45:32,842 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:45:32,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:45:32,876 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:45:32,876 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:45:32,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:45:32,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:45:32,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:45:32,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:45:32,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:45:32,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:45:32,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:45:32,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:45:32,878 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:45:32,879 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:45:32,880 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:45:32,880 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:45:32,880 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 04:45:32,880 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:45:32,880 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-12-02 04:45:32,880 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 04:45:32,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 04:45:32,923 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-12-02 04:45:32,923 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-12-02 04:45:32,928 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2018-12-02 04:45:32,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 04:45:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-02 04:45:32,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-02 04:45:32,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:32,929 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:32,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 04:45:32,969 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-12-02 04:45:32,969 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-12-02 04:45:32,974 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2018-12-02 04:45:32,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 04:45:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-02 04:45:32,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-02 04:45:32,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:32,975 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:32,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:32,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 04:45:33,015 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-12-02 04:45:33,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-12-02 04:45:33,027 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 392 states and 547 transitions. Complement of second has 7 states. [2018-12-02 04:45:33,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 04:45:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-02 04:45:33,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-02 04:45:33,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:33,028 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:45:33,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:45:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:33,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:45:33,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:45:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 04:45:33,070 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-12-02 04:45:33,070 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-12-02 04:45:33,095 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 511 states and 724 transitions. Complement of second has 12 states. [2018-12-02 04:45:33,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 04:45:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 04:45:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-12-02 04:45:33,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-02 04:45:33,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:33,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 23 letters. Loop has 18 letters. [2018-12-02 04:45:33,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:33,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 36 letters. [2018-12-02 04:45:33,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:45:33,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 724 transitions. [2018-12-02 04:45:33,100 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 04:45:33,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 0 states and 0 transitions. [2018-12-02 04:45:33,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 04:45:33,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 04:45:33,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 04:45:33,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:45:33,101 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:45:33,101 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:45:33,101 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:45:33,101 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 04:45:33,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 04:45:33,101 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 04:45:33,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 04:45:33,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 04:45:33 BoogieIcfgContainer [2018-12-02 04:45:33,107 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 04:45:33,107 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:45:33,107 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:45:33,107 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:45:33,108 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:45:28" (3/4) ... [2018-12-02 04:45:33,111 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 04:45:33,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:45:33,111 INFO L168 Benchmark]: Toolchain (without parser) took 4839.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 954.4 MB in the beginning and 888.3 MB in the end (delta: 66.1 MB). Peak memory consumption was 348.2 MB. Max. memory is 11.5 GB. [2018-12-02 04:45:33,112 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:45:33,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 116.97 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 945.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-12-02 04:45:33,112 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.10 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:45:33,113 INFO L168 Benchmark]: Boogie Preprocessor took 10.36 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:45:33,113 INFO L168 Benchmark]: RCFGBuilder took 142.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-12-02 04:45:33,113 INFO L168 Benchmark]: BuchiAutomizer took 4544.82 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 888.3 MB in the end (delta: 202.6 MB). Peak memory consumption was 376.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:45:33,114 INFO L168 Benchmark]: Witness Printer took 3.79 ms. Allocated memory is still 1.3 GB. Free memory is still 888.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:45:33,116 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 116.97 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 945.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.10 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.36 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 142.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4544.82 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 888.3 MB in the end (delta: 202.6 MB). Peak memory consumption was 376.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.79 ms. Allocated memory is still 1.3 GB. Free memory is still 888.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (4 trivial, 4 deterministic, 7 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One deterministic module has affine ranking function c and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 201 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 9 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 335 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 260 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 3, 1, 3]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 105/148 HoareTripleCheckerStatistics: 159 SDtfs, 158 SDslu, 75 SDs, 0 SdLazy, 277 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax160 hnf98 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...