./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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.24-cad4683 [2019-10-22 08:54:31,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:31,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:31,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:31,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:31,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:31,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:31,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:31,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:31,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:31,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:31,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:31,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:31,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:31,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:31,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:31,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:31,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:31,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:31,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:31,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:31,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:31,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:31,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:31,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:31,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:31,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:31,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:31,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:31,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:31,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:31,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:31,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:31,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:31,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:31,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:31,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:31,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:31,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:31,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:31,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:31,393 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:31,405 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:31,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:31,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:31,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:31,407 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:31,407 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:31,407 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:31,407 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:31,407 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:31,407 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:31,408 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:31,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:31,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:31,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:31,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:31,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:31,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:31,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:31,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:31,409 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:31,410 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:31,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:31,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:31,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:31,410 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:31,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:31,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:31,411 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:31,412 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:31,412 INFO L138 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_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:31,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:31,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:31,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:31,451 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:31,452 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:31,452 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2019-10-22 08:54:31,499 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/data/92e698b57/55e49fc4344e4ddc9e56aa1fc7c89ca2/FLAG8b61a9c07 [2019-10-22 08:54:31,889 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:31,889 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2019-10-22 08:54:31,895 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/data/92e698b57/55e49fc4344e4ddc9e56aa1fc7c89ca2/FLAG8b61a9c07 [2019-10-22 08:54:31,906 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/data/92e698b57/55e49fc4344e4ddc9e56aa1fc7c89ca2 [2019-10-22 08:54:31,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:31,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:31,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:31,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:31,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:31,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:31" (1/1) ... [2019-10-22 08:54:31,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b66c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:31, skipping insertion in model container [2019-10-22 08:54:31,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:31" (1/1) ... [2019-10-22 08:54:31,923 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:31,935 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:32,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:32,054 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:32,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:32,139 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:32,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:32 WrapperNode [2019-10-22 08:54:32,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:32,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:32,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:32,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:32,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:32" (1/1) ... [2019-10-22 08:54:32,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:32" (1/1) ... [2019-10-22 08:54:32,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:32,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:32,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:32,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:32,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:32" (1/1) ... [2019-10-22 08:54:32,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:32" (1/1) ... [2019-10-22 08:54:32,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:32" (1/1) ... [2019-10-22 08:54:32,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:32" (1/1) ... [2019-10-22 08:54:32,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:32" (1/1) ... [2019-10-22 08:54:32,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:32" (1/1) ... [2019-10-22 08:54:32,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:32" (1/1) ... [2019-10-22 08:54:32,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:32,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:32,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:32,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:32,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:32,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:32,403 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:32,403 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:54:32,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:32 BoogieIcfgContainer [2019-10-22 08:54:32,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:32,405 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:32,405 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:32,412 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:32,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:32,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:31" (1/3) ... [2019-10-22 08:54:32,414 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@253b13f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:32, skipping insertion in model container [2019-10-22 08:54:32,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:32,415 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:32" (2/3) ... [2019-10-22 08:54:32,416 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@253b13f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:32, skipping insertion in model container [2019-10-22 08:54:32,416 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:32,416 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:32" (3/3) ... [2019-10-22 08:54:32,418 INFO L371 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative.c [2019-10-22 08:54:32,467 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:32,467 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:32,468 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:32,468 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:32,468 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:32,468 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:32,468 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:32,468 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:32,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-10-22 08:54:32,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:32,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:32,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:32,513 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:54:32,514 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:32,514 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:32,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-10-22 08:54:32,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:32,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:32,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:32,515 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:54:32,515 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:32,522 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 3#L12-2true [2019-10-22 08:54:32,523 INFO L793 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~c~0 > 0); 6#L12true assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3#L12-2true [2019-10-22 08:54:32,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:32,529 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-10-22 08:54:32,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:32,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78170891] [2019-10-22 08:54:32,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:32,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:32,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:32,636 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:32,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:32,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-10-22 08:54:32,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:32,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91082466] [2019-10-22 08:54:32,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:32,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:32,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:32,655 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:32,656 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-10-22 08:54:32,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:32,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756346319] [2019-10-22 08:54:32,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:32,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:32,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:32,671 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:32,800 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-10-22 08:54:32,822 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:32,823 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:32,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:32,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:32,824 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:32,824 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:32,824 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:32,824 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:32,824 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2019-10-22 08:54:32,824 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:32,825 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:32,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,953 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:32,954 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:32,961 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:32,961 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:32,972 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:32,973 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:32,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:32,982 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:32,986 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:32,986 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:32,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:32,992 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:32,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:32,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:33,013 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:33,020 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:33,020 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:33,020 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:33,020 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:33,021 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:33,021 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:33,021 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:33,021 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:33,021 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2019-10-22 08:54:33,021 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:33,022 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:33,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,097 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:33,101 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:33,103 INFO L120 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 [2019-10-22 08:54:33,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,109 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:33,109 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,115 INFO L120 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 [2019-10-22 08:54:33,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,117 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,119 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:33,119 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,127 INFO L120 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 [2019-10-22 08:54:33,128 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,128 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,128 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,128 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,129 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,129 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,129 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,135 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:33,140 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:33,140 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:33,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:33,142 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:33,142 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:33,143 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-10-22 08:54:33,146 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:33,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:33,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:33,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:33,192 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:33,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:33,213 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 [2019-10-22 08:54:33,214 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-10-22 08:54:33,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2019-10-22 08:54:33,246 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 [2019-10-22 08:54:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-10-22 08:54:33,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-10-22 08:54:33,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:33,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-10-22 08:54:33,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:33,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-10-22 08:54:33,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:33,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-10-22 08:54:33,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:33,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-10-22 08:54:33,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-10-22 08:54:33,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-10-22 08:54:33,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-10-22 08:54:33,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:33,261 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-10-22 08:54:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-10-22 08:54:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-10-22 08:54:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-10-22 08:54:33,286 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-10-22 08:54:33,286 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-10-22 08:54:33,286 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:33,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-10-22 08:54:33,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:33,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:33,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:33,287 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:54:33,287 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:33,287 INFO L791 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 69#L12-2 assume !!(main_~c~0 > 0); 67#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 63#L12-2 [2019-10-22 08:54:33,288 INFO L793 eck$LassoCheckResult]: Loop: 63#L12-2 assume !!(main_~c~0 > 0); 64#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 63#L12-2 [2019-10-22 08:54:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-10-22 08:54:33,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:33,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092988862] [2019-10-22 08:54:33,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,297 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:33,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-10-22 08:54:33,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:33,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571985818] [2019-10-22 08:54:33,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,308 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-10-22 08:54:33,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:33,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836952095] [2019-10-22 08:54:33,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,330 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:33,362 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:33,362 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:33,363 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:33,363 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:33,363 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:33,363 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:33,363 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:33,363 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:33,363 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2019-10-22 08:54:33,363 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:33,364 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:33,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,444 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:33,445 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:33,451 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:33,451 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:33,457 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:33,457 INFO L440 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_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:33,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:33,464 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:33,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:33,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:33,480 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:33,484 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:33,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:33,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:33,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:33,485 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:33,485 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:33,485 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:33,485 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:33,485 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2019-10-22 08:54:33,485 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:33,486 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:33,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,544 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:33,545 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:33,545 INFO L120 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 [2019-10-22 08:54:33,546 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,548 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:33,550 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,554 INFO L120 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 [2019-10-22 08:54:33,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,555 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,555 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,559 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,560 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,565 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:33,570 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:33,572 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:33,573 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:33,573 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:33,573 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:33,573 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-10-22 08:54:33,574 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:33,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:33,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:33,609 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:33,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:33,621 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 [2019-10-22 08:54:33,621 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:54:33,634 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-10-22 08:54:33,635 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 [2019-10-22 08:54:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-10-22 08:54:33,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-10-22 08:54:33,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:33,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:54:33,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:33,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-10-22 08:54:33,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:33,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-10-22 08:54:33,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:33,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-10-22 08:54:33,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:54:33,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:54:33,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-10-22 08:54:33,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:33,639 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-10-22 08:54:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-10-22 08:54:33,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 08:54:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:54:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-10-22 08:54:33,642 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-10-22 08:54:33,642 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-10-22 08:54:33,643 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:33,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-10-22 08:54:33,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:33,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:33,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:33,645 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-10-22 08:54:33,645 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:33,645 INFO L791 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 123#L12-2 assume !!(main_~c~0 > 0); 121#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 124#L12-2 assume !!(main_~c~0 > 0); 125#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 117#L12-2 [2019-10-22 08:54:33,645 INFO L793 eck$LassoCheckResult]: Loop: 117#L12-2 assume !!(main_~c~0 > 0); 118#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 117#L12-2 [2019-10-22 08:54:33,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,646 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-10-22 08:54:33,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:33,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132195319] [2019-10-22 08:54:33,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,665 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-10-22 08:54:33,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:33,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552029469] [2019-10-22 08:54:33,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,675 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-10-22 08:54:33,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:33,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874138781] [2019-10-22 08:54:33,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,703 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:33,720 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:33,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:33,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:33,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:33,720 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:33,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:33,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:33,721 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:33,721 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2019-10-22 08:54:33,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:33,721 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:33,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,792 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:33,792 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:33,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:33,799 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:33,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:33,809 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:33,816 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:33,825 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:33,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:33,825 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:33,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:33,825 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:33,825 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:33,825 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:33,826 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:33,826 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2019-10-22 08:54:33,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:33,826 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:33,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,902 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:33,902 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:33,902 INFO L120 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 [2019-10-22 08:54:33,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,903 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,904 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,904 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,907 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:33,916 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:33,916 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:33,917 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:33,917 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:33,917 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:33,917 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-10-22 08:54:33,917 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:33,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:33,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:33,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:33,947 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:33,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:33,948 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 [2019-10-22 08:54:33,948 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 08:54:33,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-10-22 08:54:33,958 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 [2019-10-22 08:54:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-10-22 08:54:33,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:54:33,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:33,959 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:33,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:33,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:33,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:33,987 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:33,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:33,988 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 [2019-10-22 08:54:33,988 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 08:54:33,996 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-10-22 08:54:33,997 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 [2019-10-22 08:54:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-10-22 08:54:33,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:54:33,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:33,998 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:34,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:34,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,027 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:34,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:34,028 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 [2019-10-22 08:54:34,028 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 08:54:34,041 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2019-10-22 08:54:34,042 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 [2019-10-22 08:54:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-10-22 08:54:34,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:54:34,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:34,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:54:34,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:34,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:54:34,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:34,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-10-22 08:54:34,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:34,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-10-22 08:54:34,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-10-22 08:54:34,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:54:34,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-10-22 08:54:34,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:34,047 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-10-22 08:54:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-10-22 08:54:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-10-22 08:54:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-10-22 08:54:34,049 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-10-22 08:54:34,049 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-10-22 08:54:34,049 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:34,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-10-22 08:54:34,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:34,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:34,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:34,050 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:54:34,051 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:34,051 INFO L791 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 261#L12-2 [2019-10-22 08:54:34,051 INFO L793 eck$LassoCheckResult]: Loop: 261#L12-2 assume !!(main_~c~0 > 0); 263#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 261#L12-2 [2019-10-22 08:54:34,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,051 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-10-22 08:54:34,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:34,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583909024] [2019-10-22 08:54:34,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,060 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:34,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-10-22 08:54:34,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:34,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301016182] [2019-10-22 08:54:34,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,071 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:34,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,074 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-10-22 08:54:34,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:34,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396080538] [2019-10-22 08:54:34,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,084 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:34,101 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:34,101 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:34,101 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:34,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:34,102 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:34,102 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:34,102 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:34,102 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:34,102 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2019-10-22 08:54:34,102 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:34,102 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:34,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,171 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:34,171 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:34,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:34,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:34,184 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:34,184 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:34,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:34,192 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:34,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:34,201 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:34,211 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:34,212 INFO L440 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=0}, {ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [0, 1, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:34,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:34,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:34,220 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:34,220 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:34,225 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:34,225 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:34,233 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:34,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:34,239 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:34,240 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:34,240 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:34,240 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:34,240 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:34,241 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:34,241 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:34,241 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:34,241 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:34,241 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2019-10-22 08:54:34,241 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:34,241 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:34,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,310 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:34,310 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:34,310 INFO L120 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 [2019-10-22 08:54:34,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:34,311 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:34,311 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:34,311 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:34,311 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:34,312 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:34,312 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:34,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:34,315 INFO L120 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 [2019-10-22 08:54:34,316 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:34,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:34,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:34,316 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:34,318 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:34,318 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:34,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:34,321 INFO L120 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 [2019-10-22 08:54:34,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:34,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:34,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:34,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:34,323 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:34,323 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:34,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:34,326 INFO L120 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 [2019-10-22 08:54:34,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:34,327 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:34,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:34,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:34,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:34,328 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:34,328 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:34,331 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:34,334 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:34,334 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:54:34,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:34,334 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:34,334 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:34,335 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2019-10-22 08:54:34,335 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:34,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:34,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,360 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:34,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:34,361 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 [2019-10-22 08:54:34,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-10-22 08:54:34,369 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2019-10-22 08:54:34,369 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 [2019-10-22 08:54:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-10-22 08:54:34,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-10-22 08:54:34,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:34,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-10-22 08:54:34,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:34,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-10-22 08:54:34,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:34,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-10-22 08:54:34,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:34,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-10-22 08:54:34,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-10-22 08:54:34,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-10-22 08:54:34,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-10-22 08:54:34,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:34,372 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-10-22 08:54:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-10-22 08:54:34,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-10-22 08:54:34,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:54:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-10-22 08:54:34,374 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-10-22 08:54:34,374 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-10-22 08:54:34,374 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:34,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-10-22 08:54:34,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:34,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:34,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:34,376 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-10-22 08:54:34,377 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:34,377 INFO L791 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 306#L12-2 assume !!(main_~c~0 > 0); 307#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 313#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2019-10-22 08:54:34,377 INFO L793 eck$LassoCheckResult]: Loop: 311#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 312#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2019-10-22 08:54:34,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,377 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-10-22 08:54:34,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:34,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838736544] [2019-10-22 08:54:34,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:34,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838736544] [2019-10-22 08:54:34,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:34,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:34,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399451740] [2019-10-22 08:54:34,413 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:34,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-10-22 08:54:34,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:34,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211123094] [2019-10-22 08:54:34,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,419 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:34,435 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:34,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:34,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:34,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:34,435 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:34,435 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:34,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:34,436 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:34,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2019-10-22 08:54:34,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:34,436 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:34,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,499 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:34,500 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:34,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:34,504 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:34,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:34,515 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:34,532 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:34,532 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 15, 7] Nus: [1, 1] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:34,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:34,542 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:34,551 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:34,552 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:34,563 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:34,565 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:34,565 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:34,565 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:34,565 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:34,565 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:34,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:34,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:34,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:34,566 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2019-10-22 08:54:34,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:34,566 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:34,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,654 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:34,654 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:34,654 INFO L120 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 [2019-10-22 08:54:34,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:34,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:34,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:34,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:34,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:34,656 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:34,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:34,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:34,659 INFO L120 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 [2019-10-22 08:54:34,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:34,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:34,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:34,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:34,661 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:34,661 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:34,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:34,664 INFO L120 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 [2019-10-22 08:54:34,665 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:34,665 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:34,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:34,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:34,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:34,666 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:34,666 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:34,668 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:34,671 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:34,671 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:54:34,671 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:34,671 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:34,672 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:34,672 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2019-10-22 08:54:34,672 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:34,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,693 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:34,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:34,717 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 [2019-10-22 08:54:34,717 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:54:34,724 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2019-10-22 08:54:34,724 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 [2019-10-22 08:54:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-10-22 08:54:34,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:54:34,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:34,725 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:34,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:34,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:34,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:34,758 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 [2019-10-22 08:54:34,758 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:54:34,773 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-10-22 08:54:34,773 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 [2019-10-22 08:54:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:34,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:54:34,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:34,774 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:34,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:34,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:34,805 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 [2019-10-22 08:54:34,805 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:54:34,812 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2019-10-22 08:54:34,813 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 [2019-10-22 08:54:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-10-22 08:54:34,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:54:34,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:34,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:54:34,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:34,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 08:54:34,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:34,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-10-22 08:54:34,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:54:34,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2019-10-22 08:54:34,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-10-22 08:54:34,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-10-22 08:54:34,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-10-22 08:54:34,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:34,816 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 08:54:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-10-22 08:54:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-10-22 08:54:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-10-22 08:54:34,817 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-10-22 08:54:34,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:34,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:34,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:34,821 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2019-10-22 08:54:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:34,837 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-10-22 08:54:34,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:34,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-10-22 08:54:34,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:34,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2019-10-22 08:54:34,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-10-22 08:54:34,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-10-22 08:54:34,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-10-22 08:54:34,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:34,839 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-10-22 08:54:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-10-22 08:54:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-10-22 08:54:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-10-22 08:54:34,840 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:54:34,841 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:54:34,841 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:54:34,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-10-22 08:54:34,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:34,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:34,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:34,842 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2019-10-22 08:54:34,842 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-10-22 08:54:34,842 INFO L791 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 456#L12-2 assume !!(main_~c~0 > 0); 457#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2019-10-22 08:54:34,842 INFO L793 eck$LassoCheckResult]: Loop: 461#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2019-10-22 08:54:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2019-10-22 08:54:34,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:34,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298755176] [2019-10-22 08:54:34,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,851 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:34,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-10-22 08:54:34,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:34,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427156752] [2019-10-22 08:54:34,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,859 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:34,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2019-10-22 08:54:34,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:34,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641324523] [2019-10-22 08:54:34,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:34,870 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:34,903 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:34,904 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:34,904 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:34,904 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:34,904 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:34,904 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:34,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:34,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:34,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2019-10-22 08:54:34,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:34,904 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:34,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,965 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:34,965 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:34,981 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:34,981 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:34,985 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:34,985 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:34,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:34,992 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:34,996 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:34,996 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:35,004 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:35,004 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:35,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:35,013 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:35,020 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:35,022 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:35,022 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:35,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:35,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:35,022 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:35,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:35,023 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:35,023 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:35,023 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2019-10-22 08:54:35,023 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:35,023 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:35,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:35,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:35,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:35,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:35,078 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:35,078 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:35,079 INFO L120 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 [2019-10-22 08:54:35,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,083 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:35,085 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:35,085 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:54:35,085 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:35,086 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:35,086 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:35,086 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 201 Supporting invariants [] [2019-10-22 08:54:35,086 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:35,132 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 [2019-10-22 08:54:35,132 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-10-22 08:54:35,139 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2019-10-22 08:54:35,139 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 [2019-10-22 08:54:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-10-22 08:54:35,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:54:35,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:35,140 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:35,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:35,186 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 [2019-10-22 08:54:35,186 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-10-22 08:54:35,199 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 11 states and 14 transitions. Complement of second has 5 states. [2019-10-22 08:54:35,200 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 [2019-10-22 08:54:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:35,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:54:35,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:35,201 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:35,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:35,246 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 [2019-10-22 08:54:35,246 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-10-22 08:54:35,253 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2019-10-22 08:54:35,253 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 [2019-10-22 08:54:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-10-22 08:54:35,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:54:35,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:35,254 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:35,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:35,302 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:54:35,302 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-10-22 08:54:35,324 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 18 transitions. Complement of second has 4 states. [2019-10-22 08:54:35,325 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 [2019-10-22 08:54:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-10-22 08:54:35,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:54:35,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:35,326 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:35,371 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:54:35,371 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-10-22 08:54:35,437 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. Result 72 states and 96 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2019-10-22 08:54:35,438 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 [2019-10-22 08:54:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-10-22 08:54:35,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:54:35,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:35,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:54:35,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:35,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2019-10-22 08:54:35,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:35,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-10-22 08:54:35,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 08:54:35,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2019-10-22 08:54:35,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-10-22 08:54:35,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-10-22 08:54:35,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2019-10-22 08:54:35,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:35,445 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-10-22 08:54:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2019-10-22 08:54:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-10-22 08:54:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:54:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-10-22 08:54:35,449 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-10-22 08:54:35,449 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-10-22 08:54:35,449 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:54:35,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2019-10-22 08:54:35,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:35,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:35,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:35,450 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2019-10-22 08:54:35,450 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-10-22 08:54:35,450 INFO L791 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 823#L12-2 assume !!(main_~c~0 > 0); 826#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2019-10-22 08:54:35,450 INFO L793 eck$LassoCheckResult]: Loop: 824#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2019-10-22 08:54:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,450 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2019-10-22 08:54:35,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:35,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323117173] [2019-10-22 08:54:35,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:35,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323117173] [2019-10-22 08:54:35,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180646361] [2019-10-22 08:54:35,477 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:35,506 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-22 08:54:35,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:54:35,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:35,510 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:35,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-10-22 08:54:35,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475929995] [2019-10-22 08:54:35,510 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:35,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2019-10-22 08:54:35,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:35,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740620407] [2019-10-22 08:54:35,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:35,518 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:35,565 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:35,565 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:35,565 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:35,565 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:35,566 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:35,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:35,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:35,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:35,566 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2019-10-22 08:54:35,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:35,566 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:35,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:35,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:35,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:35,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:35,631 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:35,632 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:35,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:35,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:35,638 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:35,638 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/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 [2019-10-22 08:54:35,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:35,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:35,648 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:35,648 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:35,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:35,667 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:35,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:35,675 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:35,729 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:35,731 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:35,731 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:35,732 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:35,732 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:35,732 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:35,732 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:35,732 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:35,732 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:35,732 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2019-10-22 08:54:35,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:35,732 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:35,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:35,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:35,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:35,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:35,792 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:35,792 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:35,792 INFO L120 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 [2019-10-22 08:54:35,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,793 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,793 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,794 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:35,794 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:35,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,804 INFO L120 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 [2019-10-22 08:54:35,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,805 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,806 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:35,806 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:35,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,810 INFO L120 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 [2019-10-22 08:54:35,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,810 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,811 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,813 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:35,814 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:35,814 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:35,815 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:35,815 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:35,815 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:35,815 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-10-22 08:54:35,815 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:35,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:35,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:54:35,871 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 [2019-10-22 08:54:35,871 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-10-22 08:54:35,899 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 61 states and 87 transitions. Complement of second has 9 states. [2019-10-22 08:54:35,899 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 [2019-10-22 08:54:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-10-22 08:54:35,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-10-22 08:54:35,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:35,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2019-10-22 08:54:35,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:35,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2019-10-22 08:54:35,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:35,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2019-10-22 08:54:35,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:35,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 52 states and 75 transitions. [2019-10-22 08:54:35,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-10-22 08:54:35,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-10-22 08:54:35,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 75 transitions. [2019-10-22 08:54:35,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:35,904 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-10-22 08:54:35,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 75 transitions. [2019-10-22 08:54:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-10-22 08:54:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 08:54:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-10-22 08:54:35,908 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-10-22 08:54:35,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:35,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:35,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:35,909 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2019-10-22 08:54:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:35,924 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-10-22 08:54:35,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:35,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-10-22 08:54:35,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:35,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 36 transitions. [2019-10-22 08:54:35,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-10-22 08:54:35,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-10-22 08:54:35,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-10-22 08:54:35,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:35,927 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-22 08:54:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-10-22 08:54:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-10-22 08:54:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:54:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-10-22 08:54:35,929 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-10-22 08:54:35,929 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-10-22 08:54:35,929 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:54:35,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-10-22 08:54:35,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:35,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:35,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:35,930 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2019-10-22 08:54:35,930 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-10-22 08:54:35,931 INFO L791 eck$LassoCheckResult]: Stem: 1076#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1077#L12-2 assume !!(main_~c~0 > 0); 1093#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1091#L12-2 assume !!(main_~c~0 > 0); 1084#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2019-10-22 08:54:35,931 INFO L793 eck$LassoCheckResult]: Loop: 1078#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2019-10-22 08:54:35,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2019-10-22 08:54:35,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:35,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141019635] [2019-10-22 08:54:35,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:35,941 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:35,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2019-10-22 08:54:35,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:35,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293458913] [2019-10-22 08:54:35,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:35,949 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,950 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2019-10-22 08:54:35,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:35,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427560292] [2019-10-22 08:54:35,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:36,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427560292] [2019-10-22 08:54:36,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576487188] [2019-10-22 08:54:36,007 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:36,096 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:36,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2019-10-22 08:54:36,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686227091] [2019-10-22 08:54:36,135 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:36,135 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:36,135 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:36,135 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:36,136 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:36,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:36,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:36,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:36,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2019-10-22 08:54:36,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:36,136 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:36,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,180 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:36,180 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:36,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:36,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:36,188 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:36,188 INFO L440 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_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:36,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:36,192 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:36,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:36,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:36,245 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:36,246 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:36,246 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:36,246 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:36,246 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:36,246 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:36,246 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:36,246 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:36,246 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:36,247 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2019-10-22 08:54:36,247 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:36,247 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:36,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,307 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:36,307 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:36,307 INFO L120 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 [2019-10-22 08:54:36,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:36,309 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:36,309 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:36,309 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:36,311 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:36,311 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:36,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:36,314 INFO L120 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 [2019-10-22 08:54:36,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:36,314 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:36,315 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:36,315 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:36,315 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:36,315 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:36,315 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:36,317 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:36,319 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:36,319 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:36,320 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:36,320 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:36,320 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:36,320 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-10-22 08:54:36,320 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:36,367 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 [2019-10-22 08:54:36,367 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 08:54:36,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-10-22 08:54:36,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-10-22 08:54:36,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:54:36,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:36,397 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:36,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:36,462 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 [2019-10-22 08:54:36,462 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 08:54:36,482 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-10-22 08:54:36,483 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 [2019-10-22 08:54:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-10-22 08:54:36,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:54:36,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:36,484 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:36,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:36,533 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 [2019-10-22 08:54:36,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 08:54:36,558 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 75 states and 99 transitions. Complement of second has 13 states. [2019-10-22 08:54:36,559 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 [2019-10-22 08:54:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-10-22 08:54:36,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:54:36,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:36,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2019-10-22 08:54:36,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:36,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2019-10-22 08:54:36,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:36,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2019-10-22 08:54:36,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-10-22 08:54:36,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2019-10-22 08:54:36,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-10-22 08:54:36,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-10-22 08:54:36,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2019-10-22 08:54:36,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:36,566 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-10-22 08:54:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2019-10-22 08:54:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-10-22 08:54:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 08:54:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-10-22 08:54:36,568 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-10-22 08:54:36,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:36,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 08:54:36,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:54:36,568 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 15 states. [2019-10-22 08:54:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:36,730 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2019-10-22 08:54:36,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 08:54:36,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 181 transitions. [2019-10-22 08:54:36,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2019-10-22 08:54:36,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 109 states and 145 transitions. [2019-10-22 08:54:36,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-10-22 08:54:36,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 08:54:36,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 145 transitions. [2019-10-22 08:54:36,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:36,735 INFO L688 BuchiCegarLoop]: Abstraction has 109 states and 145 transitions. [2019-10-22 08:54:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 145 transitions. [2019-10-22 08:54:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 33. [2019-10-22 08:54:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 08:54:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-10-22 08:54:36,739 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-10-22 08:54:36,740 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-10-22 08:54:36,740 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:54:36,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-10-22 08:54:36,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-10-22 08:54:36,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:36,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:36,741 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-10-22 08:54:36,741 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2019-10-22 08:54:36,741 INFO L791 eck$LassoCheckResult]: Stem: 1722#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1724#L12-2 assume !!(main_~c~0 > 0); 1738#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1735#L12-2 assume !!(main_~c~0 > 0); 1729#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1718#L12-2 [2019-10-22 08:54:36,741 INFO L793 eck$LassoCheckResult]: Loop: 1718#L12-2 assume !!(main_~c~0 > 0); 1719#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1728#L12-2 assume !!(main_~c~0 > 0); 1734#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1733#L12-2 assume !!(main_~c~0 > 0); 1725#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1726#L12-2 assume !!(main_~c~0 > 0); 1729#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1718#L12-2 [2019-10-22 08:54:36,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2019-10-22 08:54:36,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:36,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014343618] [2019-10-22 08:54:36,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:36,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:36,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:36,749 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:36,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2019-10-22 08:54:36,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:36,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244516964] [2019-10-22 08:54:36,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:36,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:36,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:36,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244516964] [2019-10-22 08:54:36,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:36,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:36,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587881634] [2019-10-22 08:54:36,778 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:36,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:36,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:36,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:36,778 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-10-22 08:54:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:36,785 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-10-22 08:54:36,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:36,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2019-10-22 08:54:36,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:54:36,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2019-10-22 08:54:36,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:54:36,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:54:36,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-10-22 08:54:36,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:36,789 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-22 08:54:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-10-22 08:54:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-10-22 08:54:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 08:54:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-10-22 08:54:36,790 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-10-22 08:54:36,790 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-10-22 08:54:36,790 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:54:36,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-10-22 08:54:36,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:54:36,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:36,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:36,791 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-10-22 08:54:36,791 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2019-10-22 08:54:36,791 INFO L791 eck$LassoCheckResult]: Stem: 1813#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1815#L12-2 assume !!(main_~c~0 > 0); 1829#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1828#L12-2 assume !!(main_~c~0 > 0); 1821#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1809#L12-2 [2019-10-22 08:54:36,791 INFO L793 eck$LassoCheckResult]: Loop: 1809#L12-2 assume !!(main_~c~0 > 0); 1810#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1819#L12-2 assume !!(main_~c~0 > 0); 1826#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1823#L12-2 assume !!(main_~c~0 > 0); 1816#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1817#L12-2 assume !!(main_~c~0 > 0); 1827#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1824#L12-2 assume !!(main_~c~0 > 0); 1820#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1809#L12-2 [2019-10-22 08:54:36,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2019-10-22 08:54:36,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:36,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757062609] [2019-10-22 08:54:36,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:36,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:36,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:36,798 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:36,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:36,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2019-10-22 08:54:36,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:36,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763399582] [2019-10-22 08:54:36,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:36,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:36,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:36,807 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:36,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:36,808 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2019-10-22 08:54:36,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:36,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55877754] [2019-10-22 08:54:36,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:36,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:36,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:36,819 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:36,903 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:36,903 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:36,904 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:36,904 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:36,904 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:36,904 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:36,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:36,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:36,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration10_Loop [2019-10-22 08:54:36,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:36,904 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:36,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,943 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:36,944 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:36,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:36,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:36,949 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:36,949 INFO L440 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_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:36,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:36,953 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:36,961 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:36,961 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:36,965 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:36,966 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:36,966 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:36,966 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:36,967 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:36,967 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:36,967 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:36,967 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:36,967 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:36,967 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration10_Loop [2019-10-22 08:54:36,967 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:36,967 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:36,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:36,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:37,028 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:37,029 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:37,029 INFO L120 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 [2019-10-22 08:54:37,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,030 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,030 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,030 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,030 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:37,030 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:37,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,036 INFO L120 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 [2019-10-22 08:54:37,036 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:37,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,037 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,037 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,037 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:37,037 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:37,039 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:37,046 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:37,049 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:37,049 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:37,049 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:37,049 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:37,049 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-10-22 08:54:37,050 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:37,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:37,114 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 08:54:37,114 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:54:37,120 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-10-22 08:54:37,121 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 [2019-10-22 08:54:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:37,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:54:37,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:37,122 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:37,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:37,186 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 08:54:37,187 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:54:37,190 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-10-22 08:54:37,191 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 [2019-10-22 08:54:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:37,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:54:37,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:37,191 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:37,251 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 08:54:37,251 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:54:37,260 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 46 states and 60 transitions. Complement of second has 4 states. [2019-10-22 08:54:37,260 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 [2019-10-22 08:54:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-10-22 08:54:37,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:54:37,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:37,261 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:37,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:37,323 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 08:54:37,323 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:54:37,354 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 63 states and 75 transitions. Complement of second has 8 states. [2019-10-22 08:54:37,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-10-22 08:54:37,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:54:37,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:37,355 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:37,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:37,415 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 08:54:37,415 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:54:37,461 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,462 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,462 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,463 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,464 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,495 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:37,514 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. Result 404 states and 547 transitions. Complement of second has 85 states 12 powerset states73 rank states. The highest rank that occured is 7 [2019-10-22 08:54:37,516 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 [2019-10-22 08:54:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-10-22 08:54:37,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:54:37,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:37,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2019-10-22 08:54:37,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:37,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2019-10-22 08:54:37,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:37,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2019-10-22 08:54:37,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-10-22 08:54:37,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2019-10-22 08:54:37,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-10-22 08:54:37,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:54:37,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2019-10-22 08:54:37,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:37,533 INFO L688 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2019-10-22 08:54:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2019-10-22 08:54:37,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2019-10-22 08:54:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-22 08:54:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-10-22 08:54:37,545 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-10-22 08:54:37,545 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-10-22 08:54:37,545 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:54:37,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2019-10-22 08:54:37,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-10-22 08:54:37,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:37,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:37,546 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-10-22 08:54:37,547 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2019-10-22 08:54:37,547 INFO L791 eck$LassoCheckResult]: Stem: 2806#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 2809#L12-2 assume !!(main_~c~0 > 0); 2833#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2829#L12-2 assume !!(main_~c~0 > 0); 2815#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2802#L12-2 [2019-10-22 08:54:37,547 INFO L793 eck$LassoCheckResult]: Loop: 2802#L12-2 assume !!(main_~c~0 > 0); 2803#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2864#L12-2 assume !!(main_~c~0 > 0); 2857#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2855#L12-2 assume !!(main_~c~0 > 0); 2849#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2848#L12-2 assume !!(main_~c~0 > 0); 2847#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2839#L12-2 assume !!(main_~c~0 > 0); 2818#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2830#L12-2 assume !!(main_~c~0 > 0); 2828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2826#L12-2 assume !!(main_~c~0 > 0); 2814#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2802#L12-2 [2019-10-22 08:54:37,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,547 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2019-10-22 08:54:37,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:37,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995112046] [2019-10-22 08:54:37,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:37,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:37,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:37,556 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,559 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2019-10-22 08:54:37,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:37,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666655646] [2019-10-22 08:54:37,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:37,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:37,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:37,580 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,581 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2019-10-22 08:54:37,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:37,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231782961] [2019-10-22 08:54:37,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:37,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:37,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:37,605 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:37,693 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:37,693 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:37,693 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:37,694 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:37,694 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:37,694 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:37,694 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:37,694 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:37,694 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2019-10-22 08:54:37,694 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:37,694 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:37,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:37,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:37,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:37,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:37,736 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:37,736 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:37,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:37,739 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:37,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:37,753 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:37,755 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:37,756 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:37,756 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:37,757 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:37,757 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:37,757 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:37,757 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:37,757 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:37,757 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:37,757 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2019-10-22 08:54:37,757 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:37,757 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:37,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:37,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:37,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:37,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:37,802 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:37,802 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:37,803 INFO L120 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 [2019-10-22 08:54:37,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,803 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:37,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,804 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:37,804 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:37,806 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:37,807 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:37,807 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:37,808 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:37,808 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:37,808 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:37,808 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-10-22 08:54:37,808 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:37,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:37,903 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-10-22 08:54:37,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-10-22 08:54:37,910 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-10-22 08:54:37,910 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 [2019-10-22 08:54:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:37,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-10-22 08:54:37,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:37,911 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:37,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:37,995 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-10-22 08:54:37,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-10-22 08:54:38,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-10-22 08:54:38,000 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 [2019-10-22 08:54:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:38,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-10-22 08:54:38,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:38,001 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:38,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:38,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:54:38,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:38,090 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-10-22 08:54:38,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-10-22 08:54:38,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 146 states and 191 transitions. Complement of second has 4 states. [2019-10-22 08:54:38,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 [2019-10-22 08:54:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-10-22 08:54:38,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2019-10-22 08:54:38,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:38,098 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:38,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:38,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:54:38,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:38,180 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-10-22 08:54:38,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-10-22 08:54:38,212 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 172 states and 219 transitions. Complement of second has 8 states. [2019-10-22 08:54:38,212 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 [2019-10-22 08:54:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-10-22 08:54:38,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2019-10-22 08:54:38,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:38,213 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:38,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:38,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:54:38,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:38,286 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-10-22 08:54:38,286 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-10-22 08:54:38,332 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,333 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,334 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,334 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,334 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,334 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,335 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,335 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,336 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,336 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,336 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,336 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,371 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,371 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,371 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,371 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,374 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,374 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,374 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,374 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,375 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,375 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,375 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,375 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,376 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,376 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,376 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,376 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,378 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,380 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,380 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,380 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,420 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,421 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,421 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,421 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,421 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,421 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,424 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,424 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,424 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,424 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,425 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,425 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,425 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,425 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,425 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,426 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,426 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,426 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,426 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,426 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,426 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,427 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,427 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,427 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,428 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,428 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:38,452 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. Result 1787 states and 2714 transitions. Complement of second has 144 states 16 powerset states128 rank states. The highest rank that occured is 7 [2019-10-22 08:54:38,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:38,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-10-22 08:54:38,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2019-10-22 08:54:38,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:38,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2019-10-22 08:54:38,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:38,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2019-10-22 08:54:38,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:38,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2019-10-22 08:54:38,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-10-22 08:54:38,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2019-10-22 08:54:38,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:54:38,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:54:38,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2019-10-22 08:54:38,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:38,475 INFO L688 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2019-10-22 08:54:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2019-10-22 08:54:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2019-10-22 08:54:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-22 08:54:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2019-10-22 08:54:38,495 INFO L711 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-10-22 08:54:38,496 INFO L591 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-10-22 08:54:38,496 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 08:54:38,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2019-10-22 08:54:38,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-10-22 08:54:38,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:38,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:38,498 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-10-22 08:54:38,498 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2019-10-22 08:54:38,498 INFO L791 eck$LassoCheckResult]: Stem: 5719#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 5724#L12-2 assume !!(main_~c~0 > 0); 5765#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5737#L12-2 assume !!(main_~c~0 > 0); 5733#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5715#L12-2 [2019-10-22 08:54:38,498 INFO L793 eck$LassoCheckResult]: Loop: 5715#L12-2 assume !!(main_~c~0 > 0); 5716#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5934#L12-2 assume !!(main_~c~0 > 0); 5861#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5859#L12-2 assume !!(main_~c~0 > 0); 5857#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5855#L12-2 assume !!(main_~c~0 > 0); 5852#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5841#L12-2 assume !!(main_~c~0 > 0); 5842#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5824#L12-2 assume !!(main_~c~0 > 0); 5825#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5816#L12-2 assume !!(main_~c~0 > 0); 5736#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5759#L12-2 assume !!(main_~c~0 > 0); 5738#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5735#L12-2 assume !!(main_~c~0 > 0); 5732#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5715#L12-2 [2019-10-22 08:54:38,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2019-10-22 08:54:38,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:38,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621190159] [2019-10-22 08:54:38,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:38,505 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:38,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2019-10-22 08:54:38,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:38,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508256460] [2019-10-22 08:54:38,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:38,526 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:38,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,527 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2019-10-22 08:54:38,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:38,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26903237] [2019-10-22 08:54:38,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:38,545 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:38,648 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-10-22 08:54:38,659 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:38,659 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:38,659 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:38,659 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:38,659 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:38,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:38,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:38,660 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:38,660 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2019-10-22 08:54:38,660 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:38,660 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:38,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:38,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:38,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:38,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:38,710 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:38,710 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:38,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:38,713 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dde5e88-54f9-4405-bf2b-13488547bf8c/bin/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:38,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:38,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:38,755 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:38,756 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:38,756 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:38,756 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:38,756 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:38,756 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:38,756 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:38,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:38,756 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:38,756 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2019-10-22 08:54:38,756 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:38,756 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:38,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:38,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:38,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:38,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:38,808 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:38,808 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:38,808 INFO L120 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 [2019-10-22 08:54:38,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:38,809 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:38,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:38,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:38,809 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:38,809 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:38,810 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:38,811 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:38,813 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:38,813 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:38,813 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:38,813 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:38,814 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:38,814 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-10-22 08:54:38,814 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:38,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:38,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:54:38,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-22 08:54:38,906 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 [2019-10-22 08:54:38,906 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-10-22 08:54:38,916 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-10-22 08:54:38,919 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 [2019-10-22 08:54:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:54:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:38,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-10-22 08:54:38,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:38,921 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:38,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:38,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:54:38,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-22 08:54:38,991 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 [2019-10-22 08:54:38,992 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-10-22 08:54:39,007 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-10-22 08:54:39,007 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 [2019-10-22 08:54:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:54:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:39,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-10-22 08:54:39,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:39,008 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:39,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:39,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:39,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:54:39,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-22 08:54:39,083 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 [2019-10-22 08:54:39,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-10-22 08:54:39,105 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 392 states and 547 transitions. Complement of second has 7 states. [2019-10-22 08:54:39,106 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 [2019-10-22 08:54:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:54:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-10-22 08:54:39,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 18 letters. [2019-10-22 08:54:39,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:39,107 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:39,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:39,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:39,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:54:39,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-22 08:54:39,190 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 [2019-10-22 08:54:39,190 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-10-22 08:54:39,266 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 511 states and 724 transitions. Complement of second has 12 states. [2019-10-22 08:54:39,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:54:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2019-10-22 08:54:39,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 18 letters. [2019-10-22 08:54:39,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:39,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 23 letters. Loop has 18 letters. [2019-10-22 08:54:39,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:39,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 36 letters. [2019-10-22 08:54:39,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:39,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 724 transitions. [2019-10-22 08:54:39,272 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:39,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 0 states and 0 transitions. [2019-10-22 08:54:39,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:39,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:39,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:39,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:39,274 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:39,274 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:39,274 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:39,274 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 08:54:39,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:39,274 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:39,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:39,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:39 BoogieIcfgContainer [2019-10-22 08:54:39,282 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:39,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:39,283 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:39,283 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:39,283 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:32" (3/4) ... [2019-10-22 08:54:39,287 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:39,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:39,289 INFO L168 Benchmark]: Toolchain (without parser) took 7379.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 947.1 MB in the beginning and 1.3 GB in the end (delta: -366.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:39,289 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:39,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 947.1 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:39,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:39,297 INFO L168 Benchmark]: Boogie Preprocessor took 18.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:39,297 INFO L168 Benchmark]: RCFGBuilder took 214.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:39,298 INFO L168 Benchmark]: BuchiAutomizer took 6877.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -198.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:39,298 INFO L168 Benchmark]: Witness Printer took 5.36 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:39,299 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 229.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 947.1 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 214.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6877.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -198.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.36 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 15 terminating modules (4 trivial, 4 deterministic, 7 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One deterministic module has affine ranking function c and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 201 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 9 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 3.6s. Construction of modules took 0.3s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 393 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 260 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 3, 1, 3]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 105/148 HoareTripleCheckerStatistics: 154 SDtfs, 161 SDslu, 64 SDs, 0 SdLazy, 353 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax160 hnf98 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp96 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...