./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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-1dbac8b [2018-11-10 12:20:21,947 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:20:21,948 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:20:21,954 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:20:21,954 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:20:21,955 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:20:21,955 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:20:21,956 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:20:21,957 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:20:21,958 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:20:21,958 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:20:21,959 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:20:21,959 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:20:21,960 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:20:21,961 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:20:21,961 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:20:21,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:20:21,963 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:20:21,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:20:21,965 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:20:21,966 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:20:21,967 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:20:21,968 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:20:21,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:20:21,968 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:20:21,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:20:21,969 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:20:21,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:20:21,970 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:20:21,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:20:21,971 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:20:21,971 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:20:21,972 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:20:21,972 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:20:21,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:20:21,973 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:20:21,973 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:20:21,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:20:21,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:20:21,983 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:20:21,983 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:20:21,983 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:20:21,983 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:20:21,983 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:20:21,984 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:20:21,984 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:20:21,984 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:20:21,984 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:20:21,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:20:21,984 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:20:21,984 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:20:21,985 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:20:21,985 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:20:21,985 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:20:21,985 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:20:21,985 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:20:21,985 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:20:21,985 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:20:21,985 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:20:21,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:20:21,986 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:20:21,986 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:20:21,986 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:20:21,986 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:20:21,987 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:20:21,987 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_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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-11-10 12:20:22,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:20:22,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:20:22,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:20:22,027 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:20:22,027 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:20:22,028 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2018-11-10 12:20:22,072 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/data/780eb9172/789220665fd246b78f927b1941e3f848/FLAG5d8a038aa [2018-11-10 12:20:22,392 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:20:22,393 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2018-11-10 12:20:22,398 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/data/780eb9172/789220665fd246b78f927b1941e3f848/FLAG5d8a038aa [2018-11-10 12:20:22,410 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/data/780eb9172/789220665fd246b78f927b1941e3f848 [2018-11-10 12:20:22,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:20:22,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:20:22,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:20:22,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:20:22,418 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:20:22,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:20:22" (1/1) ... [2018-11-10 12:20:22,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ea8d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22, skipping insertion in model container [2018-11-10 12:20:22,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:20:22" (1/1) ... [2018-11-10 12:20:22,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:20:22,442 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:20:22,561 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:20:22,564 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:20:22,575 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:20:22,583 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:20:22,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22 WrapperNode [2018-11-10 12:20:22,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:20:22,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:20:22,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:20:22,584 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:20:22,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22" (1/1) ... [2018-11-10 12:20:22,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22" (1/1) ... [2018-11-10 12:20:22,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:20:22,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:20:22,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:20:22,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:20:22,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22" (1/1) ... [2018-11-10 12:20:22,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22" (1/1) ... [2018-11-10 12:20:22,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22" (1/1) ... [2018-11-10 12:20:22,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22" (1/1) ... [2018-11-10 12:20:22,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22" (1/1) ... [2018-11-10 12:20:22,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22" (1/1) ... [2018-11-10 12:20:22,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22" (1/1) ... [2018-11-10 12:20:22,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:20:22,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:20:22,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:20:22,616 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:20:22,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:22,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:20:22,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:20:22,767 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:20:22,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:20:22 BoogieIcfgContainer [2018-11-10 12:20:22,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:20:22,768 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:20:22,768 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:20:22,770 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:20:22,771 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:20:22,771 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:20:22" (1/3) ... [2018-11-10 12:20:22,772 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24628f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:20:22, skipping insertion in model container [2018-11-10 12:20:22,772 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:20:22,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:22" (2/3) ... [2018-11-10 12:20:22,772 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24628f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:20:22, skipping insertion in model container [2018-11-10 12:20:22,772 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:20:22,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:20:22" (3/3) ... [2018-11-10 12:20:22,774 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative_true-termination_true-no-overflow.c [2018-11-10 12:20:22,811 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:20:22,812 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:20:22,812 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:20:22,812 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:20:22,812 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:20:22,812 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:20:22,812 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:20:22,812 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:20:22,813 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:20:22,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-10 12:20:22,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:20:22,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:20:22,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:20:22,839 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:20:22,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:20:22,840 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:20:22,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-10 12:20:22,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:20:22,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:20:22,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:20:22,841 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:20:22,841 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:20:22,847 INFO L793 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~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; 4#L12-2true [2018-11-10 12:20:22,848 INFO L795 eck$LassoCheckResult]: Loop: 4#L12-2true assume true; 5#L11-1true assume !!(main_~c~0 > 0); 8#L12true assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 4#L12-2true [2018-11-10 12:20:22,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:22,853 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 12:20:22,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:22,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:22,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:22,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:22,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:22,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:22,910 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 1 times [2018-11-10 12:20:22,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:22,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:22,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:22,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:22,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:22,921 INFO L82 PathProgramCache]: Analyzing trace with hash 28694888, now seen corresponding path program 1 times [2018-11-10 12:20:22,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:22,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:22,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:22,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:22,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:22,977 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:22,978 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:22,978 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:22,978 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:22,978 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:20:22,978 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:22,978 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:22,979 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:22,979 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-10 12:20:22,979 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:22,979 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:22,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,109 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:23,109 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:23,113 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:20:23,142 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:23,161 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:20:23,162 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:23,162 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:23,162 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:23,162 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:23,162 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:20:23,162 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,162 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:23,162 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:23,162 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-10 12:20:23,162 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:23,162 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:23,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,244 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:23,248 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:20:23,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:23,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:23,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:20:23,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:23,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:23,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:23,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:20:23,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:20:23,259 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:20:23,264 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:20:23,264 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:20:23,266 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:20:23,266 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:20:23,266 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:20:23,267 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2018-11-10 12:20:23,268 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:20:23,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:23,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:23,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:23,319 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-11-10 12:20:23,320 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 3 states. [2018-11-10 12:20:23,345 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 3 states. Result 27 states and 32 transitions. Complement of second has 6 states. [2018-11-10 12:20:23,345 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-11-10 12:20:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 12:20:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-10 12:20:23,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-10 12:20:23,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:23,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-10 12:20:23,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:23,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-10 12:20:23,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:23,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-10 12:20:23,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:20:23,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 11 states and 14 transitions. [2018-11-10 12:20:23,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-10 12:20:23,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-10 12:20:23,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-10 12:20:23,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:23,356 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-10 12:20:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-10 12:20:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-10 12:20:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 12:20:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-10 12:20:23,373 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-10 12:20:23,373 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-10 12:20:23,374 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:20:23,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-10 12:20:23,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:20:23,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:20:23,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:20:23,374 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:20:23,374 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:20:23,374 INFO L793 eck$LassoCheckResult]: Stem: 84#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 75#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 76#L12-2 assume true; 77#L11-1 assume !!(main_~c~0 > 0); 78#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 81#L12-2 [2018-11-10 12:20:23,375 INFO L795 eck$LassoCheckResult]: Loop: 81#L12-2 assume true; 82#L11-1 assume !!(main_~c~0 > 0); 85#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 81#L12-2 [2018-11-10 12:20:23,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:23,375 INFO L82 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2018-11-10 12:20:23,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:23,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:23,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:23,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:23,380 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 2 times [2018-11-10 12:20:23,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:23,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:23,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:23,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:23,387 INFO L82 PathProgramCache]: Analyzing trace with hash 150863077, now seen corresponding path program 1 times [2018-11-10 12:20:23,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:23,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:23,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:23,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:23,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:23,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:23,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:20:23,439 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:23,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:23,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:23,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:23,439 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:20:23,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:23,440 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:23,440 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 12:20:23,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:23,440 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:23,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,498 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:23,498 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:23,501 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:23,520 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:20:23,520 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,522 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:23,522 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:23,538 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:20:23,538 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:23,541 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:20:23,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:23,575 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:20:23,576 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:23,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:23,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:23,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:23,577 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:20:23,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:23,577 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:23,577 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 12:20:23,577 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:23,577 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:23,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,632 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:23,632 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:20:23,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:23,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:23,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:23,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:23,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:23,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:20:23,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:20:23,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:20:23,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:23,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:23,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:23,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:23,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:23,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:20:23,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:20:23,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:20:23,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:23,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:23,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:20:23,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:23,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:23,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:23,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:20:23,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:20:23,656 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:20:23,659 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:20:23,659 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:20:23,660 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:20:23,660 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:20:23,660 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:20:23,660 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2018-11-10 12:20:23,660 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:20:23,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:23,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:23,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:23,695 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-11-10 12:20:23,696 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-10 12:20:23,702 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 17 states and 22 transitions. Complement of second has 5 states. [2018-11-10 12:20:23,703 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-11-10 12:20:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 12:20:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 12:20:23,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-10 12:20:23,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:23,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-10 12:20:23,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:23,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-10 12:20:23,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:23,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-10 12:20:23,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:20:23,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-11-10 12:20:23,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 12:20:23,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 12:20:23,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-10 12:20:23,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:23,706 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-10 12:20:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-10 12:20:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 12:20:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 12:20:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-10 12:20:23,708 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-10 12:20:23,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:20:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:20:23,711 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2018-11-10 12:20:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:23,723 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-10 12:20:23,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:20:23,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-11-10 12:20:23,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:20:23,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 23 transitions. [2018-11-10 12:20:23,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 12:20:23,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 12:20:23,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-10 12:20:23,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:23,725 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-10 12:20:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-10 12:20:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-10 12:20:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 12:20:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-10 12:20:23,727 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-10 12:20:23,727 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-10 12:20:23,727 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:20:23,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-10 12:20:23,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:20:23,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:20:23,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:20:23,729 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1] [2018-11-10 12:20:23,729 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:20:23,729 INFO L793 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 191#L12-2 assume true; 196#L11-1 assume !!(main_~c~0 > 0); 198#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 194#L12-2 assume true; 195#L11-1 assume !!(main_~c~0 > 0); 197#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 200#L12-2 assume true; 201#L11-1 assume !!(main_~c~0 > 0); 204#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 192#L12-2 [2018-11-10 12:20:23,729 INFO L795 eck$LassoCheckResult]: Loop: 192#L12-2 assume true; 193#L11-1 assume !!(main_~c~0 > 0); 203#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 192#L12-2 [2018-11-10 12:20:23,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:23,729 INFO L82 PathProgramCache]: Analyzing trace with hash -693878072, now seen corresponding path program 2 times [2018-11-10 12:20:23,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:23,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:23,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:23,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:23,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:23,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 3 times [2018-11-10 12:20:23,739 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:23,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:23,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:23,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:23,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:23,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:23,747 INFO L82 PathProgramCache]: Analyzing trace with hash 355958851, now seen corresponding path program 3 times [2018-11-10 12:20:23,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:23,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:23,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:23,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:23,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 12:20:23,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:23,788 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:23,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:20:23,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 12:20:23,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:23,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 12:20:23,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:23,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 12:20:23,855 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:23,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:23,856 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:23,856 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:23,856 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:20:23,856 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,856 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:23,856 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:23,856 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 12:20:23,856 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:23,856 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:23,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:23,916 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:23,916 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:23,918 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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-11-10 12:20:23,937 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:20:23,937 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:23,943 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:20:23,943 INFO L446 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_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:23,959 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,977 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:20:23,977 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:23,995 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:20:23,995 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:23,996 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:23,996 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:23,996 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:23,996 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:20:23,996 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:23,996 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:23,996 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:23,996 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 12:20:23,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:23,997 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:23,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,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-11-10 12:20:24,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-11-10 12:20:24,047 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:24,047 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:20:24,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:24,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:24,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:20:24,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:24,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:24,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:24,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:20:24,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:20:24,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:20:24,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-11-10 12:20:24,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:24,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:20:24,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:24,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:24,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:24,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:20:24,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:20:24,057 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:20:24,059 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:20:24,059 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:20:24,059 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:20:24,059 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:20:24,060 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:20:24,060 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2018-11-10 12:20:24,060 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:20:24,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,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-11-10 12:20:24,087 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-11-10 12:20:24,087 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-10 12:20:24,097 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 5 states. [2018-11-10 12:20:24,097 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-11-10 12:20:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 12:20:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 12:20:24,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-10 12:20:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,098 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:24,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:24,114 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-11-10 12:20:24,114 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-10 12:20:24,119 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 5 states. [2018-11-10 12:20:24,120 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-11-10 12:20:24,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 12:20:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 12:20:24,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-10 12:20:24,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,121 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:24,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:24,148 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-11-10 12:20:24,148 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-10 12:20:24,154 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 24 states and 31 transitions. Complement of second has 4 states. [2018-11-10 12:20:24,154 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-11-10 12:20:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 12:20:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-10 12:20:24,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-10 12:20:24,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-10 12:20:24,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-10 12:20:24,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2018-11-10 12:20:24,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 12:20:24,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 25 transitions. [2018-11-10 12:20:24,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 12:20:24,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 12:20:24,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-10 12:20:24,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:24,157 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-10 12:20:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-10 12:20:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 9. [2018-11-10 12:20:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 12:20:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-10 12:20:24,158 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-10 12:20:24,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:20:24,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:20:24,159 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-11-10 12:20:24,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:24,170 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-10 12:20:24,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:20:24,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2018-11-10 12:20:24,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 12:20:24,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 20 transitions. [2018-11-10 12:20:24,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 12:20:24,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 12:20:24,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-10 12:20:24,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:24,172 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-10 12:20:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-10 12:20:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-11-10 12:20:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-10 12:20:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-10 12:20:24,173 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-10 12:20:24,173 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-10 12:20:24,173 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:20:24,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-10 12:20:24,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 12:20:24,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:20:24,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:20:24,174 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:20:24,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 12:20:24,174 INFO L793 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 501#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 502#L12-2 [2018-11-10 12:20:24,174 INFO L795 eck$LassoCheckResult]: Loop: 502#L12-2 assume true; 503#L11-1 assume !!(main_~c~0 > 0); 514#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 504#L12-2 assume true; 506#L11-1 assume !!(main_~c~0 > 0); 511#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 502#L12-2 [2018-11-10 12:20:24,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 12:20:24,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:24,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:24,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:24,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1070873439, now seen corresponding path program 1 times [2018-11-10 12:20:24,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:24,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:24,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:24,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,185 INFO L82 PathProgramCache]: Analyzing trace with hash 150922657, now seen corresponding path program 4 times [2018-11-10 12:20:24,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:24,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,228 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:24,228 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:24,228 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:24,228 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:24,228 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:20:24,228 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:24,229 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:24,229 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:24,229 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-10 12:20:24,229 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:24,229 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:24,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,278 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:24,278 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:24,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:24,281 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:24,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:20:24,298 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:24,301 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:20:24,315 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:24,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:24,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:24,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:24,315 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:20:24,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:24,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:24,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:24,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-10 12:20:24,316 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:24,316 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:24,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,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-11-10 12:20:24,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,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-11-10 12:20:24,351 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:24,351 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:20:24,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:24,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:24,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:20:24,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:24,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:24,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:24,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:20:24,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:20:24,356 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:20:24,358 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:20:24,358 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:20:24,358 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:20:24,358 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:20:24,358 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:20:24,358 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 201 Supporting invariants [] [2018-11-10 12:20:24,359 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:20:24,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:24,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:20:24,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 12:20:24,406 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 33 states and 39 transitions. Complement of second has 5 states. [2018-11-10 12:20:24,407 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-11-10 12:20:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:20:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-11-10 12:20:24,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-10 12:20:24,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,408 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:24,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:24,435 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:20:24,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 12:20:24,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 39 states and 47 transitions. Complement of second has 7 states. [2018-11-10 12:20:24,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:20:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:20:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-10 12:20:24,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-10 12:20:24,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-10 12:20:24,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-10 12:20:24,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-10 12:20:24,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 12:20:24,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 25 states and 30 transitions. [2018-11-10 12:20:24,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-10 12:20:24,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-10 12:20:24,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-10 12:20:24,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:24,465 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-10 12:20:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-10 12:20:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-11-10 12:20:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 12:20:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-11-10 12:20:24,467 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-10 12:20:24,467 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-10 12:20:24,467 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:20:24,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2018-11-10 12:20:24,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 12:20:24,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:20:24,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:20:24,468 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1] [2018-11-10 12:20:24,469 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:20:24,469 INFO L793 eck$LassoCheckResult]: Stem: 673#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 666#L12-2 assume true; 667#L11-1 assume !!(main_~c~0 > 0); 685#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 684#L12-2 assume true; 677#L11-1 assume !!(main_~c~0 > 0); 683#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 682#L12-2 assume true; 681#L11-1 assume !!(main_~c~0 > 0); 680#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 676#L12-2 assume true; 669#L11-1 [2018-11-10 12:20:24,469 INFO L795 eck$LassoCheckResult]: Loop: 669#L11-1 assume !!(main_~c~0 > 0); 670#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 674#L12-2 assume true; 669#L11-1 [2018-11-10 12:20:24,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,469 INFO L82 PathProgramCache]: Analyzing trace with hash -33536704, now seen corresponding path program 5 times [2018-11-10 12:20:24,469 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:24,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:24,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:24,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash 41794, now seen corresponding path program 1 times [2018-11-10 12:20:24,478 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:24,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:24,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:24,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1635443107, now seen corresponding path program 6 times [2018-11-10 12:20:24,483 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:24,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:24,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:24,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,507 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:24,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:24,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:24,507 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:24,507 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:20:24,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:24,507 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:24,507 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:24,507 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 12:20:24,507 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:24,507 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:24,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,581 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:24,581 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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-11-10 12:20:24,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:24,584 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:24,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:20:24,610 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:24,627 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:20:24,629 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:24,629 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:24,629 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:24,629 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:24,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:20:24,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:24,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:24,629 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:24,629 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 12:20:24,629 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:24,630 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:24,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,661 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:24,661 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:20:24,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:24,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:24,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:20:24,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:24,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:24,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:24,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:20:24,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:20:24,664 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:20:24,665 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:20:24,665 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:20:24,666 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:20:24,666 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:20:24,666 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:20:24,666 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 12:20:24,666 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:20:24,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:24,705 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:20:24,705 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 12:20:24,708 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 24 states and 29 transitions. Complement of second has 5 states. [2018-11-10 12:20:24,708 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-11-10 12:20:24,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:20:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-10 12:20:24,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 12:20:24,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,709 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:24,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:24,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:20:24,729 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 12:20:24,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 24 states and 29 transitions. Complement of second has 5 states. [2018-11-10 12:20:24,732 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-11-10 12:20:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:20:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-10 12:20:24,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 12:20:24,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,733 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:24,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:24,752 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:20:24,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 12:20:24,757 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 39 states and 47 transitions. Complement of second has 6 states. [2018-11-10 12:20:24,757 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-11-10 12:20:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:20:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-10 12:20:24,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 12:20:24,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-10 12:20:24,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 12:20:24,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-10 12:20:24,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 12:20:24,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 26 states and 31 transitions. [2018-11-10 12:20:24,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 12:20:24,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 12:20:24,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2018-11-10 12:20:24,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:24,761 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-10 12:20:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2018-11-10 12:20:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-11-10 12:20:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 12:20:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-10 12:20:24,762 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-10 12:20:24,762 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-10 12:20:24,762 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:20:24,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-10 12:20:24,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:20:24,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:20:24,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:20:24,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1] [2018-11-10 12:20:24,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 12:20:24,763 INFO L793 eck$LassoCheckResult]: Stem: 949#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 942#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 943#L12-2 assume true; 944#L11-1 assume !!(main_~c~0 > 0); 948#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 962#L12-2 assume true; 952#L11-1 assume !!(main_~c~0 > 0); 959#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 958#L12-2 assume true; 957#L11-1 assume !!(main_~c~0 > 0); 955#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 951#L12-2 assume true; 946#L11-1 [2018-11-10 12:20:24,763 INFO L795 eck$LassoCheckResult]: Loop: 946#L11-1 assume !!(main_~c~0 > 0); 947#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 960#L12-2 assume true; 956#L11-1 assume !!(main_~c~0 > 0); 953#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 954#L12-2 assume true; 946#L11-1 [2018-11-10 12:20:24,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash -33536704, now seen corresponding path program 7 times [2018-11-10 12:20:24,764 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:24,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:24,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:24,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 2 times [2018-11-10 12:20:24,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:24,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:24,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,774 INFO L82 PathProgramCache]: Analyzing trace with hash -623393122, now seen corresponding path program 8 times [2018-11-10 12:20:24,774 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:24,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:24,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:24,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:24,823 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:24,823 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:24,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:24,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:24,823 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:20:24,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:24,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:24,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:24,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-10 12:20:24,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:24,823 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:24,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,854 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:24,854 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:24,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:24,856 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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-11-10 12:20:24,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:20:24,875 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:24,877 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:20:24,892 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:24,892 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:24,892 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:24,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:24,892 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:20:24,892 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:24,892 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:24,892 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:24,892 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-10 12:20:24,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:24,892 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:24,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:24,924 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:24,924 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:20:24,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:24,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:24,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:20:24,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:24,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:24,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:24,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:20:24,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:20:24,928 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:20:24,929 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:20:24,929 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:20:24,929 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:20:24,930 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:20:24,930 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:20:24,930 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 221 Supporting invariants [] [2018-11-10 12:20:24,930 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:20:24,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:24,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:24,981 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-11-10 12:20:24,981 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 12:20:24,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 43 states and 49 transitions. Complement of second has 7 states. [2018-11-10 12:20:24,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:20:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 12:20:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-10 12:20:24,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 12:20:24,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:24,992 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:24,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:25,021 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-11-10 12:20:25,021 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 12:20:25,039 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 49 transitions. Complement of second has 9 states. [2018-11-10 12:20:25,039 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-11-10 12:20:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 12:20:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-10 12:20:25,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 12:20:25,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:25,040 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:25,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:25,070 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-11-10 12:20:25,070 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 12:20:25,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 70 states and 82 transitions. Complement of second has 13 states. [2018-11-10 12:20:25,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:20:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 12:20:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-10 12:20:25,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 12:20:25,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:25,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-10 12:20:25,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:25,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 12 letters. [2018-11-10 12:20:25,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:25,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 82 transitions. [2018-11-10 12:20:25,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-10 12:20:25,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 47 states and 56 transitions. [2018-11-10 12:20:25,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-10 12:20:25,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 12:20:25,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 56 transitions. [2018-11-10 12:20:25,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:25,085 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-11-10 12:20:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 56 transitions. [2018-11-10 12:20:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-11-10 12:20:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 12:20:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2018-11-10 12:20:25,087 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-10 12:20:25,087 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-10 12:20:25,087 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:20:25,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2018-11-10 12:20:25,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 12:20:25,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:20:25,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:20:25,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 3, 3, 1, 1] [2018-11-10 12:20:25,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2018-11-10 12:20:25,090 INFO L793 eck$LassoCheckResult]: Stem: 1344#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1335#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1336#L12-2 assume true; 1355#L11-1 assume !!(main_~c~0 > 0); 1352#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 1353#L12-2 assume true; 1348#L11-1 assume !!(main_~c~0 > 0); 1350#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 1347#L12-2 assume true; 1346#L11-1 assume !!(main_~c~0 > 0); 1345#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1340#L12-2 assume true; 1341#L11-1 assume !!(main_~c~0 > 0); 1366#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1367#L12-2 assume true; 1365#L11-1 assume !!(main_~c~0 > 0); 1364#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1363#L12-2 assume true; 1361#L11-1 assume !!(main_~c~0 > 0); 1362#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 1359#L12-2 assume true; 1360#L11-1 [2018-11-10 12:20:25,090 INFO L795 eck$LassoCheckResult]: Loop: 1360#L11-1 assume !!(main_~c~0 > 0); 1366#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1367#L12-2 assume true; 1365#L11-1 assume !!(main_~c~0 > 0); 1364#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1363#L12-2 assume true; 1361#L11-1 assume !!(main_~c~0 > 0); 1362#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 1359#L12-2 assume true; 1360#L11-1 [2018-11-10 12:20:25,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash -67744575, now seen corresponding path program 9 times [2018-11-10 12:20:25,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:25,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:25,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:25,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:20:25,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:25,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:20:25,126 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:20:25,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1348868896, now seen corresponding path program 3 times [2018-11-10 12:20:25,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:25,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:25,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:25,176 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:25,176 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:25,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:25,176 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:25,176 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:20:25,176 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:25,176 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:25,176 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:25,176 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-10 12:20:25,176 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:25,176 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:25,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:25,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:25,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:25,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:25,217 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:25,217 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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-11-10 12:20:25,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:25,220 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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-11-10 12:20:25,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:20:25,249 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:25,252 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:20:25,267 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:25,267 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:25,267 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:25,267 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:25,267 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:20:25,267 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:25,267 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:25,267 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:25,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-10 12:20:25,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:25,267 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:25,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:25,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:25,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:25,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:25,311 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:25,311 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:20:25,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:25,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:25,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:20:25,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:25,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:25,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:25,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:20:25,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:20:25,313 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:20:25,314 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:20:25,314 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:20:25,314 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:20:25,314 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:20:25,314 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:20:25,314 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 12:20:25,314 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:20:25,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:25,362 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-11-10 12:20:25,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-10 12:20:25,366 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 39 states and 48 transitions. Complement of second has 5 states. [2018-11-10 12:20:25,366 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-11-10 12:20:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 12:20:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-10 12:20:25,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-10 12:20:25,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:25,367 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:25,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:25,412 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-11-10 12:20:25,412 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-10 12:20:25,416 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 39 states and 48 transitions. Complement of second has 5 states. [2018-11-10 12:20:25,416 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-11-10 12:20:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 12:20:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-10 12:20:25,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-10 12:20:25,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:25,417 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:25,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:25,451 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-11-10 12:20:25,451 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-10 12:20:25,456 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 72 states and 91 transitions. Complement of second has 6 states. [2018-11-10 12:20:25,459 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-11-10 12:20:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 12:20:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-10 12:20:25,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-10 12:20:25,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:25,460 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:25,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:25,499 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 4 loop predicates [2018-11-10 12:20:25,500 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-10 12:20:25,520 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 131 states and 151 transitions. Complement of second has 19 states. [2018-11-10 12:20:25,520 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-11-10 12:20:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 12:20:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-10 12:20:25,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-10 12:20:25,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:25,521 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:25,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:25,564 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 4 loop predicates [2018-11-10 12:20:25,564 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-10 12:20:25,611 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,611 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,615 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,616 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,616 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,634 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,639 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,671 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,671 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,675 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,675 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,676 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,700 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,701 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,701 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,701 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,702 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:25,702 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. Result 982 states and 1487 transitions. Complement of second has 138 states 12 powerset states126 rank states. The highest rank that occured is 7 [2018-11-10 12:20:25,703 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-11-10 12:20:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 12:20:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2018-11-10 12:20:25,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-10 12:20:25,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:25,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 30 letters. Loop has 9 letters. [2018-11-10 12:20:25,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:25,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-10 12:20:25,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:25,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 982 states and 1487 transitions. [2018-11-10 12:20:25,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 97 [2018-11-10 12:20:25,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 982 states to 623 states and 1012 transitions. [2018-11-10 12:20:25,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 12:20:25,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2018-11-10 12:20:25,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 623 states and 1012 transitions. [2018-11-10 12:20:25,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:25,725 INFO L705 BuchiCegarLoop]: Abstraction has 623 states and 1012 transitions. [2018-11-10 12:20:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states and 1012 transitions. [2018-11-10 12:20:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 145. [2018-11-10 12:20:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-10 12:20:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 213 transitions. [2018-11-10 12:20:25,739 INFO L728 BuchiCegarLoop]: Abstraction has 145 states and 213 transitions. [2018-11-10 12:20:25,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:20:25,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:20:25,740 INFO L87 Difference]: Start difference. First operand 145 states and 213 transitions. Second operand 5 states. [2018-11-10 12:20:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:25,760 INFO L93 Difference]: Finished difference Result 191 states and 262 transitions. [2018-11-10 12:20:25,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:20:25,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 262 transitions. [2018-11-10 12:20:25,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2018-11-10 12:20:25,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 163 states and 222 transitions. [2018-11-10 12:20:25,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 12:20:25,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-10 12:20:25,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 222 transitions. [2018-11-10 12:20:25,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:25,764 INFO L705 BuchiCegarLoop]: Abstraction has 163 states and 222 transitions. [2018-11-10 12:20:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 222 transitions. [2018-11-10 12:20:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 135. [2018-11-10 12:20:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-10 12:20:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 185 transitions. [2018-11-10 12:20:25,769 INFO L728 BuchiCegarLoop]: Abstraction has 135 states and 185 transitions. [2018-11-10 12:20:25,769 INFO L608 BuchiCegarLoop]: Abstraction has 135 states and 185 transitions. [2018-11-10 12:20:25,769 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 12:20:25,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 185 transitions. [2018-11-10 12:20:25,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 54 [2018-11-10 12:20:25,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:20:25,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:20:25,771 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1] [2018-11-10 12:20:25,771 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2] [2018-11-10 12:20:25,771 INFO L793 eck$LassoCheckResult]: Stem: 3639#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3640#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 3698#L12-2 assume true; 3696#L11-1 assume !!(main_~c~0 > 0); 3691#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 3693#L12-2 assume true; 3655#L11-1 assume !!(main_~c~0 > 0); 3683#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 3653#L12-2 assume true; 3634#L11-1 [2018-11-10 12:20:25,771 INFO L795 eck$LassoCheckResult]: Loop: 3634#L11-1 assume !!(main_~c~0 > 0); 3641#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3642#L12-2 assume true; 3701#L11-1 assume !!(main_~c~0 > 0); 3705#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3704#L12-2 assume true; 3703#L11-1 assume !!(main_~c~0 > 0); 3702#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 3688#L12-2 assume true; 3682#L11-1 assume !!(main_~c~0 > 0); 3647#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 3633#L12-2 assume true; 3634#L11-1 [2018-11-10 12:20:25,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,771 INFO L82 PathProgramCache]: Analyzing trace with hash 383635139, now seen corresponding path program 2 times [2018-11-10 12:20:25,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:25,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:25,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:25,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:25,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,776 INFO L82 PathProgramCache]: Analyzing trace with hash 439271425, now seen corresponding path program 4 times [2018-11-10 12:20:25,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:25,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:25,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:25,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:20:25,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:25,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:20:25,807 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:20:25,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:20:25,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:20:25,807 INFO L87 Difference]: Start difference. First operand 135 states and 185 transitions. cyclomatic complexity: 57 Second operand 4 states. [2018-11-10 12:20:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:25,815 INFO L93 Difference]: Finished difference Result 173 states and 217 transitions. [2018-11-10 12:20:25,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:20:25,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 217 transitions. [2018-11-10 12:20:25,820 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2018-11-10 12:20:25,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 137 states and 173 transitions. [2018-11-10 12:20:25,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 12:20:25,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 12:20:25,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 173 transitions. [2018-11-10 12:20:25,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:25,821 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 173 transitions. [2018-11-10 12:20:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 173 transitions. [2018-11-10 12:20:25,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 107. [2018-11-10 12:20:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 12:20:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 136 transitions. [2018-11-10 12:20:25,825 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 136 transitions. [2018-11-10 12:20:25,825 INFO L608 BuchiCegarLoop]: Abstraction has 107 states and 136 transitions. [2018-11-10 12:20:25,825 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 12:20:25,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 136 transitions. [2018-11-10 12:20:25,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2018-11-10 12:20:25,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:20:25,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:20:25,827 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1] [2018-11-10 12:20:25,827 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 6, 4] [2018-11-10 12:20:25,827 INFO L793 eck$LassoCheckResult]: Stem: 3955#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3956#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 3947#L12-2 assume true; 4052#L11-1 assume !!(main_~c~0 > 0); 3959#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 3960#L12-2 assume true; 4047#L11-1 assume !!(main_~c~0 > 0); 4045#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 4046#L12-2 assume true; 3953#L11-1 [2018-11-10 12:20:25,827 INFO L795 eck$LassoCheckResult]: Loop: 3953#L11-1 assume !!(main_~c~0 > 0); 3954#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4043#L12-2 assume true; 4042#L11-1 assume !!(main_~c~0 > 0); 4041#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4040#L12-2 assume true; 4039#L11-1 assume !!(main_~c~0 > 0); 4030#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 4022#L12-2 assume true; 4019#L11-1 assume !!(main_~c~0 > 0); 4016#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4015#L12-2 assume true; 4012#L11-1 assume !!(main_~c~0 > 0); 4011#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 4010#L12-2 assume true; 4005#L11-1 assume !!(main_~c~0 > 0); 4009#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4008#L12-2 assume true; 4007#L11-1 assume !!(main_~c~0 > 0); 4006#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 4003#L12-2 assume true; 4004#L11-1 assume !!(main_~c~0 > 0); 4028#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4027#L12-2 assume true; 4026#L11-1 assume !!(main_~c~0 > 0); 4025#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4024#L12-2 assume true; 4023#L11-1 assume !!(main_~c~0 > 0); 4021#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 4020#L12-2 assume true; 3953#L11-1 [2018-11-10 12:20:25,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,827 INFO L82 PathProgramCache]: Analyzing trace with hash 383635139, now seen corresponding path program 3 times [2018-11-10 12:20:25,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:25,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:25,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:25,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:25,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,835 INFO L82 PathProgramCache]: Analyzing trace with hash 748806693, now seen corresponding path program 5 times [2018-11-10 12:20:25,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:25,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:25,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:25,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:25,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash -867503769, now seen corresponding path program 10 times [2018-11-10 12:20:25,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:25,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:25,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:25,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 111 proven. 39 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 12:20:25,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:25,888 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:25,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:20:25,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:20:25,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:25,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 152 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:20:25,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:25,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2018-11-10 12:20:26,088 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:26,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:26,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:26,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:26,088 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:20:26,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:26,088 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:26,088 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:26,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration9_Loop [2018-11-10 12:20:26,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:26,089 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:26,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:26,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:26,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:26,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:26,121 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:26,121 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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-11-10 12:20:26,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:26,123 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:26,140 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:20:26,140 INFO L446 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_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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-11-10 12:20:26,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:26,144 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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-11-10 12:20:26,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:20:26,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:26,857 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:20:26,858 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:26,859 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:26,859 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:26,859 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:26,859 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:20:26,859 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:26,859 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:26,859 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:26,859 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration9_Loop [2018-11-10 12:20:26,859 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:26,859 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:26,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:26,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-11-10 12:20:26,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:26,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:26,889 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:26,889 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:20:26,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:26,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:26,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:26,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:26,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:26,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:20:26,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:20:26,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:20:26,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:26,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:26,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:20:26,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:26,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:26,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:26,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:20:26,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:20:26,896 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:20:26,897 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:20:26,897 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:20:26,897 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:20:26,897 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:20:26,897 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:20:26,898 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 12:20:26,898 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:20:26,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:26,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:26,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 76 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:26,978 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2018-11-10 12:20:26,978 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36 Second operand 13 states. [2018-11-10 12:20:26,983 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36. Second operand 13 states. Result 109 states and 138 transitions. Complement of second has 5 states. [2018-11-10 12:20:26,991 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-11-10 12:20:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 12:20:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-10 12:20:26,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 9 letters. Loop has 30 letters. [2018-11-10 12:20:26,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:26,992 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:27,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:27,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:27,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 76 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:27,101 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2018-11-10 12:20:27,101 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36 Second operand 13 states. [2018-11-10 12:20:27,106 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36. Second operand 13 states. Result 109 states and 138 transitions. Complement of second has 5 states. [2018-11-10 12:20:27,107 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-11-10 12:20:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 12:20:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-10 12:20:27,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 9 letters. Loop has 30 letters. [2018-11-10 12:20:27,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:27,108 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:27,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:27,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:27,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 76 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:27,196 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 11 loop predicates [2018-11-10 12:20:27,196 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36 Second operand 13 states. [2018-11-10 12:20:27,202 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36. Second operand 13 states. Result 175 states and 205 transitions. Complement of second has 6 states. [2018-11-10 12:20:27,203 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-11-10 12:20:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 12:20:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-10 12:20:27,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 30 letters. [2018-11-10 12:20:27,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:27,204 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:27,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:27,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:27,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 76 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:27,291 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 11 loop predicates [2018-11-10 12:20:27,292 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36 Second operand 13 states. [2018-11-10 12:20:27,387 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36. Second operand 13 states. Result 592 states and 694 transitions. Complement of second has 81 states. [2018-11-10 12:20:27,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-10 12:20:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 12:20:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2018-11-10 12:20:27,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 9 letters. Loop has 30 letters. [2018-11-10 12:20:27,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:27,392 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:27,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:27,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:27,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 76 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:27,473 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 11 loop predicates [2018-11-10 12:20:27,473 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 107 states and 136 transitions. cyclomatic complexity: 36 Second operand 13 states. [2018-11-10 12:20:27,526 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,528 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,529 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,529 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,530 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,534 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,534 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,534 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,534 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,534 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,599 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,600 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,600 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,601 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,602 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,603 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,604 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,604 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,605 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,605 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,605 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,605 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,606 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,608 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,609 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,609 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,610 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,611 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,614 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,615 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,615 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,616 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,616 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,616 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,617 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,617 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,738 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,738 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,741 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,741 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,743 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,747 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,748 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,748 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,748 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,748 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,748 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,749 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,749 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,749 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,749 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,777 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,783 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,783 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,783 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,784 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,787 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,792 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,793 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,793 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,793 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,797 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,797 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,804 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,804 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,804 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,804 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,805 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,805 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,820 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,822 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,822 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,827 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,827 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,827 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,827 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,828 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,828 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,828 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,828 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,828 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,828 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,828 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,829 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,829 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,829 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,829 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,829 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,829 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,829 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,830 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,830 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,831 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,833 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,850 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,850 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,850 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,850 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,850 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,850 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,850 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,851 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,851 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,851 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,853 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,853 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,853 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,853 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,854 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,854 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,856 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,857 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,857 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,857 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,857 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,858 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,858 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,858 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,858 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,858 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,859 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,859 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,859 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,859 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,859 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,859 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,860 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,860 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,862 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,862 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,863 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,863 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,863 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,863 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,866 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,867 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,867 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,867 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,868 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,868 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,868 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,868 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,868 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,869 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,869 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,869 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,869 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,869 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,870 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,870 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,870 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,870 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,874 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,879 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,879 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,879 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,879 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,882 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,883 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,883 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,883 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,886 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,887 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,888 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,888 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,888 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,888 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,888 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,888 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,889 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,889 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,889 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,891 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,892 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,892 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,892 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,896 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,897 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,898 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,898 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,898 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,898 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,898 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,898 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,899 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,899 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,899 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,902 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,902 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,908 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,908 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,908 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,910 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,912 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,912 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,912 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,913 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,915 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,915 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,915 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,916 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,916 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,916 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,916 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,916 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,916 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,917 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,917 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,919 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,919 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,920 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,920 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,922 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,922 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,922 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,923 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,923 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,923 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,923 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,923 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,925 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,927 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,927 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,927 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,927 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,928 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,934 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,934 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,935 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,935 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,937 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,937 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,937 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,937 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,938 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,938 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,938 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,938 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,939 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,939 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,939 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,940 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,940 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,940 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,940 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,940 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,940 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,947 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,947 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,948 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,948 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,948 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,948 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,948 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,948 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,948 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,949 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,949 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,949 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,949 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,949 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,950 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,950 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,950 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,951 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,951 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,951 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,951 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,951 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,951 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,952 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,953 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,953 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,953 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,953 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,953 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,953 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,954 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,954 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,955 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,955 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-10 12:20:27,956 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,956 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,957 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,957 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-10 12:20:27,964 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 107 states and 136 transitions. cyclomatic complexity: 36 Second operand 13 states. Result 8714 states and 14786 transitions. Complement of second has 792 states 34 powerset states758 rank states. The highest rank that occured is 9 [2018-11-10 12:20:27,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-10 12:20:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 12:20:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2018-11-10 12:20:27,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 9 letters. Loop has 30 letters. [2018-11-10 12:20:27,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:27,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 39 letters. Loop has 30 letters. [2018-11-10 12:20:27,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:27,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 9 letters. Loop has 60 letters. [2018-11-10 12:20:27,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:27,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8714 states and 14786 transitions. [2018-11-10 12:20:28,023 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 905 [2018-11-10 12:20:28,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8714 states to 5393 states and 9256 transitions. [2018-11-10 12:20:28,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2018-11-10 12:20:28,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2431 [2018-11-10 12:20:28,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5393 states and 9256 transitions. [2018-11-10 12:20:28,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:28,055 INFO L705 BuchiCegarLoop]: Abstraction has 5393 states and 9256 transitions. [2018-11-10 12:20:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5393 states and 9256 transitions. [2018-11-10 12:20:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5393 to 1258. [2018-11-10 12:20:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1258 states. [2018-11-10 12:20:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1926 transitions. [2018-11-10 12:20:28,109 INFO L728 BuchiCegarLoop]: Abstraction has 1258 states and 1926 transitions. [2018-11-10 12:20:28,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 12:20:28,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:20:28,110 INFO L87 Difference]: Start difference. First operand 1258 states and 1926 transitions. Second operand 15 states. [2018-11-10 12:20:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:28,293 INFO L93 Difference]: Finished difference Result 1413 states and 1781 transitions. [2018-11-10 12:20:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 12:20:28,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1413 states and 1781 transitions. [2018-11-10 12:20:28,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-11-10 12:20:28,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1413 states to 383 states and 480 transitions. [2018-11-10 12:20:28,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-10 12:20:28,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2018-11-10 12:20:28,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 383 states and 480 transitions. [2018-11-10 12:20:28,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:20:28,303 INFO L705 BuchiCegarLoop]: Abstraction has 383 states and 480 transitions. [2018-11-10 12:20:28,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states and 480 transitions. [2018-11-10 12:20:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 276. [2018-11-10 12:20:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-10 12:20:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 350 transitions. [2018-11-10 12:20:28,308 INFO L728 BuchiCegarLoop]: Abstraction has 276 states and 350 transitions. [2018-11-10 12:20:28,308 INFO L608 BuchiCegarLoop]: Abstraction has 276 states and 350 transitions. [2018-11-10 12:20:28,308 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 12:20:28,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 350 transitions. [2018-11-10 12:20:28,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-11-10 12:20:28,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:20:28,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:20:28,310 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1] [2018-11-10 12:20:28,310 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 6, 5] [2018-11-10 12:20:28,310 INFO L793 eck$LassoCheckResult]: Stem: 18151#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 18152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 18212#L12-2 assume true; 18202#L11-1 assume !!(main_~c~0 > 0); 18203#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 18194#L12-2 assume true; 18195#L11-1 assume !!(main_~c~0 > 0); 18185#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 18171#L12-2 assume true; 18172#L11-1 assume !!(main_~c~0 > 0); 18165#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 18166#L12-2 assume true; 18143#L11-1 [2018-11-10 12:20:28,310 INFO L795 eck$LassoCheckResult]: Loop: 18143#L11-1 assume !!(main_~c~0 > 0); 18144#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 18381#L12-2 assume true; 18380#L11-1 assume !!(main_~c~0 > 0); 18379#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 18378#L12-2 assume true; 18376#L11-1 assume !!(main_~c~0 > 0); 18373#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 18371#L12-2 assume true; 18372#L11-1 assume !!(main_~c~0 > 0); 18367#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 18368#L12-2 assume true; 18363#L11-1 assume !!(main_~c~0 > 0); 18364#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 18359#L12-2 assume true; 18360#L11-1 assume !!(main_~c~0 > 0); 18334#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 18335#L12-2 assume true; 18325#L11-1 assume !!(main_~c~0 > 0); 18326#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 18305#L12-2 assume true; 18306#L11-1 assume !!(main_~c~0 > 0); 18301#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 18302#L12-2 assume true; 18297#L11-1 assume !!(main_~c~0 > 0); 18298#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 18216#L12-2 assume true; 18161#L11-1 assume !!(main_~c~0 > 0); 18174#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 18173#L12-2 assume true; 18169#L11-1 assume !!(main_~c~0 > 0); 18170#L12 assume !(main_~x~0 > 100);main_~x~0 := main_~x~0 + 11;main_~c~0 := main_~c~0 + 1; 18160#L12-2 assume true; 18143#L11-1 [2018-11-10 12:20:28,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash -33536642, now seen corresponding path program 4 times [2018-11-10 12:20:28,310 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:28,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:28,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:28,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:28,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1171125864, now seen corresponding path program 6 times [2018-11-10 12:20:28,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:28,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:28,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:28,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:28,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:28,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:28,325 INFO L82 PathProgramCache]: Analyzing trace with hash -460249157, now seen corresponding path program 11 times [2018-11-10 12:20:28,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:28,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:28,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:28,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:28,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:28,477 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-11-10 12:20:28,482 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:28,483 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:28,483 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:28,483 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:28,483 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:20:28,483 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:28,483 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:28,483 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:28,483 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2018-11-10 12:20:28,483 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:28,483 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:28,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:28,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:28,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:28,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:28,513 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:28,513 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:28,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:28,515 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:28,531 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:20:28,531 INFO L446 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_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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-11-10 12:20:28,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:20:28,535 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa746e0-69c0-421e-ab35-1709acb4e0b1/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-11-10 12:20:28,552 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:20:28,552 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:20:28,605 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:20:28,606 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:20:28,606 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:20:28,606 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:20:28,606 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:20:28,606 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:20:28,606 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:20:28,606 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:20:28,607 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:20:28,607 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2018-11-10 12:20:28,607 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:20:28,607 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:20:28,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:28,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:28,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:28,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:20:28,637 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:20:28,637 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:20:28,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:28,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:28,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:28,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:28,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:28,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:20:28,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:20:28,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:20:28,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:20:28,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:20:28,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:20:28,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:20:28,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:20:28,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:20:28,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:20:28,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:20:28,643 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:20:28,644 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:20:28,644 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:20:28,644 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:20:28,644 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:20:28,645 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:20:28,645 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-10 12:20:28,645 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:20:28,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:28,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:28,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 12:20:28,706 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-11-10 12:20:28,706 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85 Second operand 8 states. [2018-11-10 12:20:28,711 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85. Second operand 8 states. Result 280 states and 354 transitions. Complement of second has 5 states. [2018-11-10 12:20:28,719 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-11-10 12:20:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:20:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-10 12:20:28,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 12 letters. Loop has 33 letters. [2018-11-10 12:20:28,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:28,719 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:28,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:28,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:28,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 12:20:28,779 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-11-10 12:20:28,779 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85 Second operand 8 states. [2018-11-10 12:20:28,784 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85. Second operand 8 states. Result 280 states and 354 transitions. Complement of second has 5 states. [2018-11-10 12:20:28,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-11-10 12:20:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:20:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-10 12:20:28,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 12 letters. Loop has 33 letters. [2018-11-10 12:20:28,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:28,787 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:28,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:28,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:28,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 12:20:28,837 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-11-10 12:20:28,837 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85 Second operand 8 states. [2018-11-10 12:20:28,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85. Second operand 8 states. Result 423 states and 503 transitions. Complement of second has 9 states. [2018-11-10 12:20:28,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:20:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:20:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-10 12:20:28,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 33 letters. [2018-11-10 12:20:28,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:28,862 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:20:28,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:28,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:28,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 12:20:28,944 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-11-10 12:20:28,944 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85 Second operand 8 states. [2018-11-10 12:20:28,976 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85. Second operand 8 states. Result 640 states and 770 transitions. Complement of second has 27 states. [2018-11-10 12:20:28,976 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-11-10 12:20:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:20:28,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-10 12:20:28,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 12 letters. Loop has 33 letters. [2018-11-10 12:20:28,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:28,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 45 letters. Loop has 33 letters. [2018-11-10 12:20:28,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:28,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 12 letters. Loop has 66 letters. [2018-11-10 12:20:28,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:20:28,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 640 states and 770 transitions. [2018-11-10 12:20:28,983 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:20:28,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 640 states to 0 states and 0 transitions. [2018-11-10 12:20:28,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:20:28,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:20:28,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:20:28,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:20:28,983 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:20:28,984 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:20:28,984 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:20:28,984 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 12:20:28,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:20:28,984 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:20:28,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:20:28,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:20:28 BoogieIcfgContainer [2018-11-10 12:20:28,989 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:20:28,990 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:20:28,990 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:20:28,990 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:20:28,991 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:20:22" (3/4) ... [2018-11-10 12:20:28,994 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:20:28,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:20:28,994 INFO L168 Benchmark]: Toolchain (without parser) took 6581.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 963.0 MB in the beginning and 1.2 GB in the end (delta: -197.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:28,995 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:20:28,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.37 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 951.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:28,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.52 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:20:28,996 INFO L168 Benchmark]: Boogie Preprocessor took 10.62 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:28,996 INFO L168 Benchmark]: RCFGBuilder took 151.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:28,997 INFO L168 Benchmark]: BuchiAutomizer took 6221.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -35.8 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:28,997 INFO L168 Benchmark]: Witness Printer took 3.87 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:20:29,001 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.37 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 951.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.52 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.62 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 151.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6221.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -35.8 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.87 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (5 trivial, 3 deterministic, 6 nondeterministic). One deterministic module has affine ranking function -2 * x + 211 and consists of 4 locations. One deterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One deterministic module has affine ranking function -2 * x + 201 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 221 and consists of 4 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 14 locations. One nondeterministic module has affine ranking function c and consists of 7 locations. 5 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 11 iterations. TraceHistogramMax:11. Analysis of lassos took 3.3s. Construction of modules took 0.3s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 9. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 4813 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 276 states and ocurred in iteration 9. Nontrivial modules had stage [2, 1, 3, 1, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 213/315 HoareTripleCheckerStatistics: 224 SDtfs, 236 SDslu, 203 SDs, 0 SdLazy, 364 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT5 conc0 concLT3 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax161 hnf98 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...