./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-30f4e4a [2019-11-28 02:58:30,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:58:30,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:58:30,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:58:30,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:58:30,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:58:30,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:58:30,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:58:30,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:58:30,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:58:30,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:58:30,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:58:30,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:58:30,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:58:30,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:58:30,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:58:30,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:58:30,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:58:30,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:58:30,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:58:30,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:58:30,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:58:30,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:58:30,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:58:30,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:58:30,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:58:30,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:58:30,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:58:30,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:58:30,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:58:30,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:58:30,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:58:30,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:58:30,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:58:30,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:58:30,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:58:30,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:58:30,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:58:30,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:58:30,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:58:30,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:58:30,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 02:58:30,446 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:58:30,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:58:30,448 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:58:30,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:58:30,448 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:58:30,449 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 02:58:30,449 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 02:58:30,449 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 02:58:30,449 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 02:58:30,450 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 02:58:30,450 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 02:58:30,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:58:30,451 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:58:30,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:58:30,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:58:30,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 02:58:30,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 02:58:30,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 02:58:30,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:58:30,453 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 02:58:30,453 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:58:30,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 02:58:30,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:58:30,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:58:30,454 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 02:58:30,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:58:30,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:58:30,455 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 02:58:30,456 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 02:58:30,457 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-11-28 02:58:30,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:58:30,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:58:30,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:58:30,798 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:58:30,798 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:58:30,800 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2019-11-28 02:58:30,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c956d6459/9b0534f3cbb849c1a2f57a122bd7a051/FLAGa7266a708 [2019-11-28 02:58:31,292 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:58:31,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2019-11-28 02:58:31,299 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c956d6459/9b0534f3cbb849c1a2f57a122bd7a051/FLAGa7266a708 [2019-11-28 02:58:31,701 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c956d6459/9b0534f3cbb849c1a2f57a122bd7a051 [2019-11-28 02:58:31,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:58:31,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:58:31,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:58:31,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:58:31,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:58:31,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:58:31" (1/1) ... [2019-11-28 02:58:31,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3dded2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31, skipping insertion in model container [2019-11-28 02:58:31,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:58:31" (1/1) ... [2019-11-28 02:58:31,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:58:31,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:58:31,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:58:31,920 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:58:31,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:58:31,944 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:58:31,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31 WrapperNode [2019-11-28 02:58:31,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:58:31,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:58:31,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:58:31,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:58:31,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31" (1/1) ... [2019-11-28 02:58:31,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31" (1/1) ... [2019-11-28 02:58:31,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:58:31,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:58:31,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:58:31,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:58:32,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31" (1/1) ... [2019-11-28 02:58:32,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31" (1/1) ... [2019-11-28 02:58:32,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31" (1/1) ... [2019-11-28 02:58:32,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31" (1/1) ... [2019-11-28 02:58:32,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31" (1/1) ... [2019-11-28 02:58:32,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31" (1/1) ... [2019-11-28 02:58:32,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31" (1/1) ... [2019-11-28 02:58:32,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:58:32,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:58:32,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:58:32,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:58:32,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:58:32,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:58:32,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:58:32,233 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:58:32,233 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 02:58:32,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:32 BoogieIcfgContainer [2019-11-28 02:58:32,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:58:32,235 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 02:58:32,235 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 02:58:32,238 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 02:58:32,238 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:32,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:58:31" (1/3) ... [2019-11-28 02:58:32,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@476b0eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:58:32, skipping insertion in model container [2019-11-28 02:58:32,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:32,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31" (2/3) ... [2019-11-28 02:58:32,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@476b0eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:58:32, skipping insertion in model container [2019-11-28 02:58:32,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:32,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:32" (3/3) ... [2019-11-28 02:58:32,242 INFO L371 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative.c [2019-11-28 02:58:32,287 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 02:58:32,287 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 02:58:32,287 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 02:58:32,288 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:58:32,288 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:58:32,288 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 02:58:32,288 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:58:32,288 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 02:58:32,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-28 02:58:32,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 02:58:32,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:32,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:32,328 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:32,329 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:58:32,329 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 02:58:32,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-28 02:58:32,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 02:58:32,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:32,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:32,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:32,330 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:58:32,336 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 3#L12-2true [2019-11-28 02:58:32,337 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~c~0 > 0); 6#L12true assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3#L12-2true [2019-11-28 02:58:32,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:32,341 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 02:58:32,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:32,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174015104] [2019-11-28 02:58:32,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:32,444 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:32,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-11-28 02:58:32,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:32,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159361917] [2019-11-28 02:58:32,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:32,463 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:32,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:32,464 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-11-28 02:58:32,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:32,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373962403] [2019-11-28 02:58:32,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:32,480 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:32,595 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-28 02:58:32,628 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:32,629 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:32,629 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:32,629 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:32,630 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:32,630 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:32,630 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:32,630 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:32,630 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2019-11-28 02:58:32,631 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:32,631 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:32,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:32,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:32,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:32,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:32,829 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:32,830 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:32,839 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:32,840 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-11-28 02:58:32,852 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:32,853 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:32,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:32,863 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:32,872 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:32,872 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:32,886 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:32,886 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:58:32,899 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:32,899 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:32,910 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:32,913 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:32,913 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:32,913 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:32,914 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:32,914 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:32,914 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:32,914 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:32,914 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:32,915 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2019-11-28 02:58:32,915 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:32,915 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:32,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:32,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:32,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:32,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:33,165 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:33,171 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,190 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 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:33,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:33,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:33,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:33,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:33,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:33,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,221 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-11-28 02:58:33,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:33,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:33,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:33,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:33,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:33,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,260 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-11-28 02:58:33,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:33,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:33,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:33,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:33,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:33,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:33,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,272 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:33,285 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 02:58:33,285 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,301 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:33,301 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:33,301 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:33,303 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-28 02:58:33,310 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:33,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:33,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:33,388 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:33,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:33,412 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-11-28 02:58:33,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-11-28 02:58:33,466 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-11-28 02:58:33,467 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-11-28 02:58:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:58:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-28 02:58:33,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-28 02:58:33,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:33,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 02:58:33,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:33,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-28 02:58:33,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:33,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-11-28 02:58:33,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 02:58:33,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-11-28 02:58:33,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-28 02:58:33,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-28 02:58:33,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-11-28 02:58:33,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:33,486 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-28 02:58:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-11-28 02:58:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-28 02:58:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:58:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-28 02:58:33,516 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-28 02:58:33,517 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-28 02:58:33,517 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 02:58:33,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-11-28 02:58:33,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 02:58:33,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:33,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:33,518 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 02:58:33,519 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:58:33,519 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 69#L12-2 assume !!(main_~c~0 > 0); 67#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 63#L12-2 [2019-11-28 02:58:33,519 INFO L796 eck$LassoCheckResult]: Loop: 63#L12-2 assume !!(main_~c~0 > 0); 64#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 63#L12-2 [2019-11-28 02:58:33,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:33,520 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-28 02:58:33,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:33,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739881472] [2019-11-28 02:58:33,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:33,533 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:33,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-11-28 02:58:33,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:33,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023732023] [2019-11-28 02:58:33,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:33,543 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:33,544 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-11-28 02:58:33,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:33,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760852798] [2019-11-28 02:58:33,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:33,566 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:33,589 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:33,589 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:33,589 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:33,589 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:33,589 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:33,589 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,590 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:33,590 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:33,590 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2019-11-28 02:58:33,590 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:33,590 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:33,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:33,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:33,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:33,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:33,678 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:33,679 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,684 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:33,684 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-11-28 02:58:33,689 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:33,689 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:58:33,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:33,697 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:33,712 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:33,726 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:33,729 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:33,730 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:33,730 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:33,730 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:33,730 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:33,730 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,730 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:33,730 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:33,731 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2019-11-28 02:58:33,731 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:33,731 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:33,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-11-28 02:58:33,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-11-28 02:58:33,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:33,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-11-28 02:58:33,837 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:33,837 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,852 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-11-28 02:58:33,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:33,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:33,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:33,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:33,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:33,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,885 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-11-28 02:58:33,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:33,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:33,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:33,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:33,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:33,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:33,900 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:33,906 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:33,906 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,912 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:33,912 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:33,912 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:33,913 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:58:33,916 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:33,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:33,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:33,958 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:33,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:33,973 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-11-28 02:58:33,973 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 02:58:33,994 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-11-28 02:58:33,995 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-11-28 02:58:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:58:33,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-28 02:58:33,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 02:58:33,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:33,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 02:58:33,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:33,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-28 02:58:33,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:33,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-11-28 02:58:33,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 02:58:34,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-11-28 02:58:34,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:58:34,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 02:58:34,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-11-28 02:58:34,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:34,002 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-28 02:58:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-11-28 02:58:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-28 02:58:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 02:58:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-11-28 02:58:34,007 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-28 02:58:34,007 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-28 02:58:34,007 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 02:58:34,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-11-28 02:58:34,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 02:58:34,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:34,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:34,010 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 02:58:34,010 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:58:34,010 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 123#L12-2 assume !!(main_~c~0 > 0); 121#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 124#L12-2 assume !!(main_~c~0 > 0); 125#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 117#L12-2 [2019-11-28 02:58:34,010 INFO L796 eck$LassoCheckResult]: Loop: 117#L12-2 assume !!(main_~c~0 > 0); 118#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 117#L12-2 [2019-11-28 02:58:34,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-11-28 02:58:34,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:34,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609328103] [2019-11-28 02:58:34,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,047 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:34,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:34,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-11-28 02:58:34,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:34,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444590277] [2019-11-28 02:58:34,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,070 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:34,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:34,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-11-28 02:58:34,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:34,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129553502] [2019-11-28 02:58:34,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,103 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:34,126 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:34,127 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:34,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:34,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:34,127 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:34,127 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:34,127 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:34,127 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:34,128 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2019-11-28 02:58:34,128 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:34,128 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:34,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,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-11-28 02:58:34,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,213 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:34,213 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:34,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:34,220 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:34,237 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:34,237 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:34,245 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:34,247 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:34,247 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:34,247 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:34,248 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:34,248 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:34,248 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:34,248 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:34,248 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:34,248 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2019-11-28 02:58:34,248 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:34,249 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:34,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,328 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:34,328 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:58:34,336 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-11-28 02:58:34,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:34,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:34,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:34,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:34,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:34,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:34,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:34,344 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:34,350 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:34,350 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:58:34,355 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:34,355 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:34,355 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:34,356 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-28 02:58:34,358 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:34,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:34,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:34,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:34,400 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:34,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:34,401 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-11-28 02:58:34,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 02:58:34,414 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-11-28 02:58:34,415 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-11-28 02:58:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:58:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-28 02:58:34,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 02:58:34,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:34,416 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:34,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:34,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:34,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:34,458 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:34,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:34,459 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-11-28 02:58:34,459 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 02:58:34,474 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-11-28 02:58:34,477 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-11-28 02:58:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:58:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-28 02:58:34,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 02:58:34,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:34,478 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:34,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:34,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:34,515 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:34,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:34,516 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-11-28 02:58:34,517 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 02:58:34,532 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-11-28 02:58:34,533 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-11-28 02:58:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:58:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:58:34,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 02:58:34,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:34,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 02:58:34,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:34,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 02:58:34,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:34,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-11-28 02:58:34,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:58:34,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-11-28 02:58:34,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-28 02:58:34,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 02:58:34,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-11-28 02:58:34,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:34,544 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-28 02:58:34,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-11-28 02:58:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-11-28 02:58:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:58:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-11-28 02:58:34,547 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-28 02:58:34,547 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-28 02:58:34,548 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 02:58:34,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-11-28 02:58:34,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:58:34,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:34,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:34,551 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:34,551 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:58:34,551 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 261#L12-2 [2019-11-28 02:58:34,552 INFO L796 eck$LassoCheckResult]: Loop: 261#L12-2 assume !!(main_~c~0 > 0); 263#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 261#L12-2 [2019-11-28 02:58:34,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 02:58:34,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:34,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619002018] [2019-11-28 02:58:34,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,567 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:34,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:34,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-11-28 02:58:34,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:34,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001182828] [2019-11-28 02:58:34,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,583 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:34,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:34,584 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-11-28 02:58:34,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:34,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400969669] [2019-11-28 02:58:34,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,611 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:34,629 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:34,629 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:34,629 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:34,630 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:34,630 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:34,630 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:34,630 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:34,630 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:34,630 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2019-11-28 02:58:34,630 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:34,630 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:34,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,703 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:34,703 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:34,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:34,722 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-11-28 02:58:34,728 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:34,728 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:34,757 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:34,757 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:34,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:34,788 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-11-28 02:58:34,801 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:34,802 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:34,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:34,819 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 [2019-11-28 02:58:34,825 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:34,825 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:34,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:34,836 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 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:34,850 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:34,851 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:34,859 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:34,861 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:34,861 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:34,861 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:34,862 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:34,862 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:34,862 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:34,862 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:34,862 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:34,862 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2019-11-28 02:58:34,862 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:34,862 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:34,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:34,937 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:34,938 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:34,966 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 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:58:34,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:34,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:34,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:34,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:34,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:34,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:34,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:58:34,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:58:34,986 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-11-28 02:58:34,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:34,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:34,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:34,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:34,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:34,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:34,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,011 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-11-28 02:58:35,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:35,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:35,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:35,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:35,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:35,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:35,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,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-11-28 02:58:35,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:35,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:35,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:35,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:35,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:35,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:35,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:35,043 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:35,043 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,048 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:35,048 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:35,049 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:35,049 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,060 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:35,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:35,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:35,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:35,092 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:35,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:35,093 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-11-28 02:58:35,093 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-28 02:58:35,102 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-11-28 02:58:35,103 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-11-28 02:58:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:58:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-11-28 02:58:35,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-28 02:58:35,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:35,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 02:58:35,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:35,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-28 02:58:35,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:35,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-11-28 02:58:35,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:58:35,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-11-28 02:58:35,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-28 02:58:35,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-11-28 02:58:35,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-11-28 02:58:35,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:35,106 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-28 02:58:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-11-28 02:58:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-28 02:58:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:58:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-11-28 02:58:35,108 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-28 02:58:35,108 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-28 02:58:35,108 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 02:58:35,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-11-28 02:58:35,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:58:35,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:35,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:35,111 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-11-28 02:58:35,111 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:58:35,111 INFO L794 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 306#L12-2 assume !!(main_~c~0 > 0); 307#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 313#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2019-11-28 02:58:35,111 INFO L796 eck$LassoCheckResult]: Loop: 311#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 312#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2019-11-28 02:58:35,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,112 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-11-28 02:58:35,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:35,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619602545] [2019-11-28 02:58:35,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:35,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619602545] [2019-11-28 02:58:35,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:35,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:58:35,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12011536] [2019-11-28 02:58:35,155 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:35,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-11-28 02:58:35,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:35,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944216237] [2019-11-28 02:58:35,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:35,162 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:35,190 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:35,190 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:35,190 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:35,190 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:35,190 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:35,190 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,191 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:35,191 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:35,191 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2019-11-28 02:58:35,191 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:35,191 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:35,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,263 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:35,263 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:35,270 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:58:35,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:35,283 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:35,301 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:35,301 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:58:35,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:35,310 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:35,318 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,336 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:35,338 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:35,339 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:35,339 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:35,339 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:35,339 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:35,339 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,339 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:35,339 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:35,339 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2019-11-28 02:58:35,339 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:35,340 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:35,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,426 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:35,426 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,437 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-11-28 02:58:35,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:35,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:35,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:35,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:35,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:35,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:35,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,451 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-11-28 02:58:35,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:35,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:35,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:35,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:35,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:35,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,469 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-11-28 02:58:35,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:35,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:35,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:35,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:35,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:35,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:35,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:35,477 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:35,477 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,481 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:35,481 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:35,481 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:35,482 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-11-28 02:58:35,483 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:35,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:35,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:35,508 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:35,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:35,536 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-11-28 02:58:35,536 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 02:58:35,546 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-11-28 02:58:35,548 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-11-28 02:58:35,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:58:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 02:58:35,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 02:58:35,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:35,549 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:35,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:35,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:35,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:35,571 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:35,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:35,588 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-11-28 02:58:35,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 02:58:35,612 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-11-28 02:58:35,612 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-11-28 02:58:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:58:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:58:35,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 02:58:35,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:35,613 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:35,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:35,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:35,642 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:35,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:35,659 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-11-28 02:58:35,659 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 02:58:35,667 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-11-28 02:58:35,667 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-11-28 02:58:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:58:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-28 02:58:35,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 02:58:35,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:35,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-28 02:58:35,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:35,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-28 02:58:35,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:35,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-28 02:58:35,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 02:58:35,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2019-11-28 02:58:35,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 02:58:35,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 02:58:35,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-28 02:58:35,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:35,671 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 02:58:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-28 02:58:35,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-11-28 02:58:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:58:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-28 02:58:35,673 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-28 02:58:35,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:35,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:58:35,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:58:35,677 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2019-11-28 02:58:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:35,695 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-11-28 02:58:35,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:58:35,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-11-28 02:58:35,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 02:58:35,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2019-11-28 02:58:35,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 02:58:35,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 02:58:35,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-11-28 02:58:35,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:35,698 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-28 02:58:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-11-28 02:58:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-11-28 02:58:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:58:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-28 02:58:35,699 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-28 02:58:35,699 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-28 02:58:35,699 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 02:58:35,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-11-28 02:58:35,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 02:58:35,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:35,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:35,700 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2019-11-28 02:58:35,700 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-28 02:58:35,701 INFO L794 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 456#L12-2 assume !!(main_~c~0 > 0); 457#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2019-11-28 02:58:35,701 INFO L796 eck$LassoCheckResult]: Loop: 461#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2019-11-28 02:58:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,701 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2019-11-28 02:58:35,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:35,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026255210] [2019-11-28 02:58:35,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:35,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:35,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-11-28 02:58:35,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:35,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254030167] [2019-11-28 02:58:35,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:35,718 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:35,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2019-11-28 02:58:35,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:35,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246639526] [2019-11-28 02:58:35,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:35,731 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:35,767 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:35,767 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:35,767 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:35,768 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:35,768 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:35,768 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,768 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:35,768 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:35,768 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2019-11-28 02:58:35,768 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:35,768 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:35,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,826 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:35,827 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:35,838 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,842 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:35,842 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:35,848 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,852 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:35,852 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:35,859 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:35,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:35,875 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:35,876 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:35,877 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:35,877 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:35,877 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:35,877 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:35,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,877 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:35,877 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:35,877 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2019-11-28 02:58:35,877 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:35,878 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:35,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,946 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:35,947 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,958 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 Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:35,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:35,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:35,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:35,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:35,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:35,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:35,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:35,968 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:35,968 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,973 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:35,973 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:35,973 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:35,974 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-11-28 02:58:35,976 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:36,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:36,095 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-11-28 02:58:36,095 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 02:58:36,111 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-11-28 02:58:36,113 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-11-28 02:58:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 02:58:36,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 02:58:36,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:36,114 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:36,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:36,176 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-11-28 02:58:36,176 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 02:58:36,191 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-11-28 02:58:36,192 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-11-28 02:58:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:36,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:58:36,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 02:58:36,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:36,192 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:36,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:36,244 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-11-28 02:58:36,244 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 02:58:36,257 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-11-28 02:58:36,258 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-11-28 02:58:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-28 02:58:36,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 02:58:36,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:36,260 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:36,329 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-11-28 02:58:36,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 02:58:36,349 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-11-28 02:58:36,351 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-11-28 02:58:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:58:36,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 02:58:36,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:36,353 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:36,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:36,400 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-11-28 02:58:36,401 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 02:58:36,473 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-11-28 02:58:36,473 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-11-28 02:58:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-28 02:58:36,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 02:58:36,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:36,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 02:58:36,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:36,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2019-11-28 02:58:36,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:36,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-11-28 02:58:36,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 02:58:36,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2019-11-28 02:58:36,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-11-28 02:58:36,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-11-28 02:58:36,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2019-11-28 02:58:36,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:36,483 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-11-28 02:58:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2019-11-28 02:58:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-11-28 02:58:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 02:58:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-11-28 02:58:36,486 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-11-28 02:58:36,486 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-11-28 02:58:36,486 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 02:58:36,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2019-11-28 02:58:36,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:58:36,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:36,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:36,488 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2019-11-28 02:58:36,488 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-11-28 02:58:36,488 INFO L794 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 823#L12-2 assume !!(main_~c~0 > 0); 826#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2019-11-28 02:58:36,488 INFO L796 eck$LassoCheckResult]: Loop: 824#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2019-11-28 02:58:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:36,489 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2019-11-28 02:58:36,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:36,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444415901] [2019-11-28 02:58:36,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:58:36,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444415901] [2019-11-28 02:58:36,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428327732] [2019-11-28 02:58:36,529 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:36,550 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-28 02:58:36,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:36,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:58:36,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:36,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 02:58:36,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157345424] [2019-11-28 02:58:36,555 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:36,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:36,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2019-11-28 02:58:36,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:36,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627990830] [2019-11-28 02:58:36,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:36,565 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:36,635 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:36,635 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:36,635 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:36,635 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:36,636 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:36,636 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:36,636 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:36,636 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:36,636 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2019-11-28 02:58:36,636 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:36,637 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:36,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:36,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:36,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:36,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:36,723 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:36,724 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:36,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:36,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:36,732 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:36,732 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:36,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:36,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:36,740 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:36,740 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:36,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:36,747 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:36,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:36,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:36,796 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:36,797 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:36,798 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:36,798 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:36,798 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:36,798 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:36,798 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:36,798 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:36,798 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:36,799 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2019-11-28 02:58:36,799 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:36,799 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:36,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:36,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:36,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:36,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:36,881 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:36,881 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:36,888 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-11-28 02:58:36,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:36,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:36,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:36,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:36,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:36,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:36,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:36,905 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-11-28 02:58:36,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:36,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:36,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:36,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:36,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:36,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:36,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:36,926 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-11-28 02:58:36,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:36,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:36,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:36,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:36,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:36,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:36,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:36,933 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:36,936 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 02:58:36,936 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:36,941 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:36,941 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:36,941 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:36,941 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-28 02:58:36,944 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:36,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:58:36,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:58:36,993 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-11-28 02:58:36,993 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-28 02:58:37,032 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-11-28 02:58:37,034 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-11-28 02:58:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:58:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-28 02:58:37,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-28 02:58:37,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:37,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 02:58:37,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:37,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2019-11-28 02:58:37,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:37,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2019-11-28 02:58:37,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:58:37,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 52 states and 75 transitions. [2019-11-28 02:58:37,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 02:58:37,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 02:58:37,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 75 transitions. [2019-11-28 02:58:37,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:37,040 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-11-28 02:58:37,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 75 transitions. [2019-11-28 02:58:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-11-28 02:58:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 02:58:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-11-28 02:58:37,053 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-11-28 02:58:37,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:37,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:58:37,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:58:37,057 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2019-11-28 02:58:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:37,077 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-28 02:58:37,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:58:37,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-11-28 02:58:37,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:58:37,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 36 transitions. [2019-11-28 02:58:37,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-11-28 02:58:37,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-11-28 02:58:37,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-28 02:58:37,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:37,079 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-28 02:58:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-28 02:58:37,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-11-28 02:58:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 02:58:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-11-28 02:58:37,082 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-28 02:58:37,082 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-28 02:58:37,082 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 02:58:37,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-11-28 02:58:37,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:58:37,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:37,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:37,084 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2019-11-28 02:58:37,084 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-11-28 02:58:37,084 INFO L794 eck$LassoCheckResult]: Stem: 1076#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1077#L12-2 assume !!(main_~c~0 > 0); 1093#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1091#L12-2 assume !!(main_~c~0 > 0); 1084#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2019-11-28 02:58:37,084 INFO L796 eck$LassoCheckResult]: Loop: 1078#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2019-11-28 02:58:37,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:37,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2019-11-28 02:58:37,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:37,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225255825] [2019-11-28 02:58:37,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:37,098 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2019-11-28 02:58:37,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:37,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560021384] [2019-11-28 02:58:37,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:37,108 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:37,109 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2019-11-28 02:58:37,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:37,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501328146] [2019-11-28 02:58:37,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:37,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501328146] [2019-11-28 02:58:37,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246352465] [2019-11-28 02:58:37,191 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:37,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:58:37,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:58:37,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:37,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2019-11-28 02:58:37,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004266372] [2019-11-28 02:58:37,380 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:37,380 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:37,380 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:37,380 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:37,380 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:37,380 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:37,381 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:37,381 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:37,381 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2019-11-28 02:58:37,381 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:37,381 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:37,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:37,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:37,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:37,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:37,462 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:37,463 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:37,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:37,469 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:37,473 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:37,473 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:37,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:37,478 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:37,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:37,489 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:37,550 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:37,552 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:37,552 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:37,552 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:37,552 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:37,552 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:37,552 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:37,552 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:37,553 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:37,553 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2019-11-28 02:58:37,553 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:37,553 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:37,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:37,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:37,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:37,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:37,667 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:37,667 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:37,672 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-11-28 02:58:37,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:37,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:37,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:37,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:37,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:37,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:37,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:37,686 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-11-28 02:58:37,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:37,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:37,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:37,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:37,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:37,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:37,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:37,692 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:37,696 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:37,696 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:37,701 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:37,701 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:37,701 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:37,701 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-28 02:58:37,703 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:37,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:37,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:37,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:37,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:58:37,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:37,764 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-11-28 02:58:37,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 02:58:37,783 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-11-28 02:58:37,787 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-11-28 02:58:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:58:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-28 02:58:37,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:58:37,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:37,787 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:37,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:37,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:37,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:37,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:58:37,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:37,843 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-11-28 02:58:37,843 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 02:58:37,866 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-11-28 02:58:37,868 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-11-28 02:58:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:58:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-28 02:58:37,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:58:37,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:37,870 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:37,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:37,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:37,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:37,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:58:37,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:37,921 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-11-28 02:58:37,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 02:58:37,959 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-11-28 02:58:37,960 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-11-28 02:58:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:58:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-28 02:58:37,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:58:37,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:37,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-28 02:58:37,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:37,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-28 02:58:37,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:37,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2019-11-28 02:58:37,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-11-28 02:58:37,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2019-11-28 02:58:37,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 02:58:37,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 02:58:37,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2019-11-28 02:58:37,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:37,965 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-11-28 02:58:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2019-11-28 02:58:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-11-28 02:58:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 02:58:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-11-28 02:58:37,969 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-28 02:58:37,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:37,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 02:58:37,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:58:37,970 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 15 states. [2019-11-28 02:58:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:38,152 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2019-11-28 02:58:38,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:58:38,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 181 transitions. [2019-11-28 02:58:38,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2019-11-28 02:58:38,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 109 states and 145 transitions. [2019-11-28 02:58:38,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 02:58:38,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 02:58:38,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 145 transitions. [2019-11-28 02:58:38,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:38,157 INFO L688 BuchiCegarLoop]: Abstraction has 109 states and 145 transitions. [2019-11-28 02:58:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 145 transitions. [2019-11-28 02:58:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 33. [2019-11-28 02:58:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 02:58:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-28 02:58:38,162 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 02:58:38,162 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 02:58:38,162 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 02:58:38,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-28 02:58:38,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:58:38,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:38,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:38,163 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 02:58:38,163 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2019-11-28 02:58:38,163 INFO L794 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-11-28 02:58:38,164 INFO L796 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-11-28 02:58:38,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:38,164 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2019-11-28 02:58:38,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:38,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912680057] [2019-11-28 02:58:38,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:38,173 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:38,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:38,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2019-11-28 02:58:38,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:38,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59927535] [2019-11-28 02:58:38,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:58:38,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59927535] [2019-11-28 02:58:38,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:38,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:58:38,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47441024] [2019-11-28 02:58:38,204 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:38,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:38,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:58:38,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:58:38,205 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-28 02:58:38,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:38,215 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-11-28 02:58:38,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:58:38,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2019-11-28 02:58:38,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 02:58:38,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2019-11-28 02:58:38,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 02:58:38,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 02:58:38,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-11-28 02:58:38,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:38,219 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-11-28 02:58:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-11-28 02:58:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-11-28 02:58:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 02:58:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-28 02:58:38,222 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-28 02:58:38,222 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-28 02:58:38,222 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 02:58:38,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-11-28 02:58:38,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 02:58:38,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:38,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:38,224 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 02:58:38,224 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2019-11-28 02:58:38,224 INFO L794 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-11-28 02:58:38,224 INFO L796 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-11-28 02:58:38,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2019-11-28 02:58:38,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:38,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241322853] [2019-11-28 02:58:38,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:38,234 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:38,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:38,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2019-11-28 02:58:38,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:38,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876655791] [2019-11-28 02:58:38,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:38,247 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:38,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:38,247 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2019-11-28 02:58:38,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:38,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147718908] [2019-11-28 02:58:38,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:38,268 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:38,360 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:38,360 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:38,360 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:38,360 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:38,360 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:38,361 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:38,361 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:38,361 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:38,361 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration10_Loop [2019-11-28 02:58:38,361 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:38,361 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:38,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:38,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-11-28 02:58:38,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:38,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-11-28 02:58:38,440 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:38,441 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:38,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:38,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:38,451 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:38,451 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:38,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:38,465 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:38,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:38,475 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:38,482 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:38,484 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:38,484 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:38,484 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:38,484 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:38,484 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:38,484 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:38,485 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:38,485 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:38,485 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration10_Loop [2019-11-28 02:58:38,485 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:38,485 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:38,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:38,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:38,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:38,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:38,549 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:38,549 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:38,562 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-11-28 02:58:38,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:38,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:38,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:38,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:38,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:38,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:38,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:38,579 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 Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:38,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:38,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:38,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:38,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:38,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:38,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:38,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:38,588 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:38,590 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:38,591 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:38,594 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:38,594 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:38,594 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:38,594 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-28 02:58:38,596 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:38,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:38,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:38,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:58:38,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:38,672 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-11-28 02:58:38,672 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 02:58:38,678 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-11-28 02:58:38,679 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-11-28 02:58:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:58:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:58:38,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 02:58:38,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:38,679 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:38,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:38,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:38,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:38,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:58:38,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:38,759 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-11-28 02:58:38,759 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 02:58:38,762 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-11-28 02:58:38,763 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-11-28 02:58:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:58:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:58:38,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 02:58:38,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:38,763 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:38,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:38,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:38,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:38,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:58:38,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:38,825 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-11-28 02:58:38,826 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 02:58:38,835 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-11-28 02:58:38,835 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-11-28 02:58:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:58:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:58:38,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 02:58:38,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:38,836 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:38,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:38,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:38,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:38,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:58:38,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:38,897 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-11-28 02:58:38,897 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 02:58:38,931 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-11-28 02:58:38,932 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-11-28 02:58:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:58:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-28 02:58:38,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 02:58:38,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:38,932 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:38,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:38,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:38,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:38,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:58:38,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:39,009 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-11-28 02:58:39,009 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 02:58:39,059 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,059 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,060 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,060 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,061 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,101 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,101 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,102 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,102 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,103 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,103 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,103 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,104 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:39,119 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-11-28 02:58:39,120 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-11-28 02:58:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:58:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-11-28 02:58:39,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 02:58:39,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:39,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2019-11-28 02:58:39,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:39,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2019-11-28 02:58:39,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:39,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2019-11-28 02:58:39,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-28 02:58:39,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2019-11-28 02:58:39,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-28 02:58:39,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 02:58:39,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2019-11-28 02:58:39,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:39,134 INFO L688 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2019-11-28 02:58:39,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2019-11-28 02:58:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2019-11-28 02:58:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 02:58:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-11-28 02:58:39,150 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-28 02:58:39,150 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-28 02:58:39,150 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 02:58:39,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2019-11-28 02:58:39,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-28 02:58:39,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:39,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:39,152 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 02:58:39,152 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2019-11-28 02:58:39,152 INFO L794 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-11-28 02:58:39,152 INFO L796 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-11-28 02:58:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:39,153 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2019-11-28 02:58:39,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:39,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461603439] [2019-11-28 02:58:39,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:39,161 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:39,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:39,161 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2019-11-28 02:58:39,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:39,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64110784] [2019-11-28 02:58:39,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:39,178 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:39,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:39,179 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2019-11-28 02:58:39,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:39,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433704864] [2019-11-28 02:58:39,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:39,197 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:39,319 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-11-28 02:58:39,346 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:39,347 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:39,347 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:39,347 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:39,347 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:39,347 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:39,347 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:39,347 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:39,347 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2019-11-28 02:58:39,347 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:39,348 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:39,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:39,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:39,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:39,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-11-28 02:58:39,415 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:39,415 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:39,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:39,419 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:39,427 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:39,427 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:39,430 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:39,432 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:39,432 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:39,432 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:39,432 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:39,432 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:39,432 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:39,432 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:39,432 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:39,432 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2019-11-28 02:58:39,433 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:39,433 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:39,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:39,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:39,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:39,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-11-28 02:58:39,514 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:39,514 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:39,522 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-11-28 02:58:39,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:39,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:39,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:39,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:39,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:39,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:39,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:39,527 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:39,529 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:39,530 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:39,533 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:39,533 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:39,533 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:39,533 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-28 02:58:39,535 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:39,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:39,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:39,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:39,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:58:39,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:39,637 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-11-28 02:58:39,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 02:58:39,643 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-11-28 02:58:39,644 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-11-28 02:58:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:58:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:58:39,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 02:58:39,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:39,644 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:39,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:39,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:39,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:39,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:58:39,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:39,751 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-11-28 02:58:39,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 02:58:39,766 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-11-28 02:58:39,766 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-11-28 02:58:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:58:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:58:39,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 02:58:39,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:39,767 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:39,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:39,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:39,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:39,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:58:39,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:39,863 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-11-28 02:58:39,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 02:58:39,871 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-11-28 02:58:39,872 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-11-28 02:58:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:58:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:58:39,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 02:58:39,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:39,873 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:39,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:39,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:39,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:39,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:58:39,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:39,984 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-11-28 02:58:39,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 02:58:40,028 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-11-28 02:58:40,030 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-11-28 02:58:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:58:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-28 02:58:40,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 02:58:40,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:40,031 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:40,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:40,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:40,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:40,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:58:40,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:40,140 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-11-28 02:58:40,140 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 02:58:40,216 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,216 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,218 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,218 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,218 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,219 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,219 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,219 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,222 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,222 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,281 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,281 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,282 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,282 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,284 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,291 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,292 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,292 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,292 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,293 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,293 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,293 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,294 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,359 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,359 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,359 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,360 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,365 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,365 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,366 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,366 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,366 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,366 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,368 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,368 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,368 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,369 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,369 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,369 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,370 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,370 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,370 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,371 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,372 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:58:40,414 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-11-28 02:58:40,415 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-11-28 02:58:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:58:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-11-28 02:58:40,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 02:58:40,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:40,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2019-11-28 02:58:40,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:40,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2019-11-28 02:58:40,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:40,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2019-11-28 02:58:40,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-28 02:58:40,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2019-11-28 02:58:40,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:58:40,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 02:58:40,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2019-11-28 02:58:40,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:40,456 INFO L688 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2019-11-28 02:58:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2019-11-28 02:58:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2019-11-28 02:58:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-28 02:58:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2019-11-28 02:58:40,488 INFO L711 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-11-28 02:58:40,489 INFO L591 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-11-28 02:58:40,489 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 02:58:40,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2019-11-28 02:58:40,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-28 02:58:40,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:40,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:40,493 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 02:58:40,493 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2019-11-28 02:58:40,493 INFO L794 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-11-28 02:58:40,493 INFO L796 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-11-28 02:58:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:40,494 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2019-11-28 02:58:40,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:40,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831546471] [2019-11-28 02:58:40,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:40,517 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:40,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:40,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2019-11-28 02:58:40,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:40,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102118602] [2019-11-28 02:58:40,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:40,539 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:40,540 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2019-11-28 02:58:40,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:40,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668609183] [2019-11-28 02:58:40,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:40,560 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:40,750 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-11-28 02:58:40,764 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:40,764 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:40,764 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:40,764 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:40,765 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:40,765 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:40,765 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:40,765 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:40,765 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2019-11-28 02:58:40,765 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:40,765 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:40,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:40,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:40,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-11-28 02:58:40,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:40,824 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:40,824 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:40,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:40,830 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:40,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:40,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:40,880 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:40,882 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:40,882 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:40,882 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:40,882 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:40,882 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:40,882 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:40,882 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:40,882 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:40,882 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2019-11-28 02:58:40,883 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:40,883 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:40,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:40,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:40,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:40,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:40,953 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:40,954 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:40,959 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-11-28 02:58:40,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:40,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:40,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:40,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:40,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:40,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:40,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:40,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:40,965 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:40,965 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:40,968 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:40,969 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:40,969 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:40,969 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-28 02:58:40,970 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:40,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:40,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:40,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:40,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:58:40,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 02:58:41,049 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-11-28 02:58:41,049 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-28 02:58:41,060 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-11-28 02:58:41,061 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-11-28 02:58:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:58:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:58:41,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 02:58:41,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:41,062 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:41,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:41,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:41,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:41,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:58:41,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 02:58:41,130 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-11-28 02:58:41,130 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-28 02:58:41,143 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-11-28 02:58:41,144 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-11-28 02:58:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:58:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:58:41,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 02:58:41,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:41,144 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:41,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:41,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:41,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:41,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:58:41,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 02:58:41,220 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-11-28 02:58:41,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-28 02:58:41,242 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-11-28 02:58:41,243 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-11-28 02:58:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:58:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-28 02:58:41,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 02:58:41,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:41,243 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:41,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:41,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:41,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:41,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:58:41,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 02:58:41,329 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-11-28 02:58:41,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-28 02:58:41,379 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-11-28 02:58:41,379 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-11-28 02:58:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:58:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2019-11-28 02:58:41,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 02:58:41,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:41,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 23 letters. Loop has 18 letters. [2019-11-28 02:58:41,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:41,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 36 letters. [2019-11-28 02:58:41,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:41,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 724 transitions. [2019-11-28 02:58:41,388 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 02:58:41,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 0 states and 0 transitions. [2019-11-28 02:58:41,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 02:58:41,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 02:58:41,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 02:58:41,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:58:41,389 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:58:41,389 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:58:41,389 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:58:41,389 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 02:58:41,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:58:41,390 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 02:58:41,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 02:58:41,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 02:58:41 BoogieIcfgContainer [2019-11-28 02:58:41,399 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 02:58:41,400 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:58:41,400 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:58:41,400 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:58:41,401 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:32" (3/4) ... [2019-11-28 02:58:41,406 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 02:58:41,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:58:41,408 INFO L168 Benchmark]: Toolchain (without parser) took 9701.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.6 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -221.5 MB). Peak memory consumption was 104.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:41,409 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:58:41,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.06 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:41,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.34 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:58:41,410 INFO L168 Benchmark]: Boogie Preprocessor took 76.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:41,411 INFO L168 Benchmark]: RCFGBuilder took 185.43 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:41,411 INFO L168 Benchmark]: BuchiAutomizer took 9164.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -65.9 MB). Peak memory consumption was 126.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:41,411 INFO L168 Benchmark]: Witness Printer took 6.55 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:58:41,414 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 237.06 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.34 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 185.43 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9164.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -65.9 MB). Peak memory consumption was 126.5 MB. Max. memory is 11.5 GB. * Witness Printer took 6.55 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 9.1s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 5.2s. Construction of modules took 0.4s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.1s 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.4s 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: 35ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...