./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.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 ff3652fa62b489d4e6a4a85c8349c06d13bd2232 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:17:07,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:17:07,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:17:07,289 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:17:07,289 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:17:07,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:17:07,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:17:07,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:17:07,297 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:17:07,298 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:17:07,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:17:07,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:17:07,301 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:17:07,302 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:17:07,304 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:17:07,305 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:17:07,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:17:07,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:17:07,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:17:07,320 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:17:07,323 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:17:07,326 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:17:07,328 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:17:07,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:17:07,329 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:17:07,329 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:17:07,331 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:17:07,332 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:17:07,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:17:07,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:17:07,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:17:07,335 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:17:07,335 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:17:07,337 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:17:07,338 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:17:07,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:17:07,339 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:17:07,354 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:17:07,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:17:07,356 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:17:07,356 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:17:07,356 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:17:07,356 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:17:07,356 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:17:07,356 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:17:07,357 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:17:07,357 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:17:07,357 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:17:07,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:17:07,357 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:17:07,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:17:07,358 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:17:07,358 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:17:07,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:17:07,358 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:17:07,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:17:07,358 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:17:07,359 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:17:07,359 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:17:07,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:17:07,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:17:07,359 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:17:07,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:17:07,360 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:17:07,360 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:17:07,362 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:17:07,362 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> ff3652fa62b489d4e6a4a85c8349c06d13bd2232 [2019-01-14 02:17:07,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:17:07,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:17:07,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:17:07,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:17:07,416 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:17:07,417 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c [2019-01-14 02:17:07,480 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e79b7a95/fffc5230d5f941968e73a1ac596112eb/FLAG858dd1990 [2019-01-14 02:17:07,892 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:17:07,893 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c [2019-01-14 02:17:07,899 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e79b7a95/fffc5230d5f941968e73a1ac596112eb/FLAG858dd1990 [2019-01-14 02:17:08,267 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e79b7a95/fffc5230d5f941968e73a1ac596112eb [2019-01-14 02:17:08,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:17:08,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:17:08,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:17:08,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:17:08,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:17:08,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:17:08" (1/1) ... [2019-01-14 02:17:08,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28cbed20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08, skipping insertion in model container [2019-01-14 02:17:08,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:17:08" (1/1) ... [2019-01-14 02:17:08,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:17:08,305 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:17:08,519 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:17:08,524 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:17:08,545 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:17:08,561 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:17:08,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08 WrapperNode [2019-01-14 02:17:08,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:17:08,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:17:08,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:17:08,563 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:17:08,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08" (1/1) ... [2019-01-14 02:17:08,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08" (1/1) ... [2019-01-14 02:17:08,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:17:08,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:17:08,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:17:08,607 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:17:08,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08" (1/1) ... [2019-01-14 02:17:08,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08" (1/1) ... [2019-01-14 02:17:08,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08" (1/1) ... [2019-01-14 02:17:08,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08" (1/1) ... [2019-01-14 02:17:08,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08" (1/1) ... [2019-01-14 02:17:08,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08" (1/1) ... [2019-01-14 02:17:08,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08" (1/1) ... [2019-01-14 02:17:08,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:17:08,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:17:08,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:17:08,629 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:17:08,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08" (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-01-14 02:17:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:17:08,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:17:09,089 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:17:09,090 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:17:09,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:17:09 BoogieIcfgContainer [2019-01-14 02:17:09,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:17:09,094 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:17:09,094 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:17:09,099 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:17:09,100 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:17:09,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:17:08" (1/3) ... [2019-01-14 02:17:09,101 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29368296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:17:09, skipping insertion in model container [2019-01-14 02:17:09,101 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:17:09,101 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:08" (2/3) ... [2019-01-14 02:17:09,102 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29368296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:17:09, skipping insertion in model container [2019-01-14 02:17:09,102 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:17:09,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:17:09" (3/3) ... [2019-01-14 02:17:09,104 INFO L375 chiAutomizerObserver]: Analyzing ICFG PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c [2019-01-14 02:17:09,165 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:17:09,166 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:17:09,166 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:17:09,166 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:17:09,166 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:17:09,166 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:17:09,167 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:17:09,167 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:17:09,167 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:17:09,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:17:09,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:17:09,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:09,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:09,213 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:17:09,214 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:09,214 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:17:09,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:17:09,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:17:09,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:09,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:09,216 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:17:09,216 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:09,224 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 3#L17-2true [2019-01-14 02:17:09,224 INFO L796 eck$LassoCheckResult]: Loop: 3#L17-2true assume !!(main_~x~0 >= 0);main_~y~0 := 1; 6#L19-2true assume !(main_~y~0 < main_~x~0); 5#L19-3true main_~x~0 := main_~x~0 - 1; 3#L17-2true [2019-01-14 02:17:09,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:09,231 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:17:09,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:09,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:09,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:09,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:09,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:09,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:09,313 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-14 02:17:09,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:09,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:09,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:09,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:09,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:09,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:09,328 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2019-01-14 02:17:09,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:09,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:09,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:09,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:09,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:09,527 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 02:17:09,548 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:09,549 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:09,549 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:09,549 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:09,549 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:09,550 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:09,550 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:09,550 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:09,550 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:17:09,550 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:09,551 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:09,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:09,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:09,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:09,859 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:09,860 INFO L412 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:09,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:09,871 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:09,896 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:09,896 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:09,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:09,906 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:09,927 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:09,927 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:09,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:09,942 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) [2019-01-14 02:17:10,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:10,000 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:10,059 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:10,062 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:10,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:10,063 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:10,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:10,063 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:10,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:10,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:10,064 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:10,065 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:17:10,065 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:10,065 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:10,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:10,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:10,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:10,338 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:10,342 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:10,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:17:10,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:10,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:10,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:10,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:10,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:10,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:10,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:10,361 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:10,374 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:10,375 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:17:10,377 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:10,378 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:17:10,379 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:10,379 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2019-01-14 02:17:10,381 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:17:10,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:10,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:10,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:10,825 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-01-14 02:17:10,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-01-14 02:17:10,910 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 23 states and 35 transitions. Complement of second has 7 states. [2019-01-14 02:17:10,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:17:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-01-14 02:17:10,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-14 02:17:10,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:10,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:17:10,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:10,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-14 02:17:10,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:10,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 35 transitions. [2019-01-14 02:17:10,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:17:10,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-14 02:17:10,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:17:10,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:17:10,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-14 02:17:10,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:10,935 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:17:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-14 02:17:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-14 02:17:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:17:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-14 02:17:10,970 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-14 02:17:10,970 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-14 02:17:10,970 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:17:10,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. [2019-01-14 02:17:10,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:17:10,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:10,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:10,974 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:17:10,974 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:17:10,975 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 70#L17-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 72#L19-2 [2019-01-14 02:17:10,976 INFO L796 eck$LassoCheckResult]: Loop: 72#L19-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; 72#L19-2 [2019-01-14 02:17:10,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:10,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:17:10,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:10,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:10,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:10,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:10,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:10,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:10,997 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-14 02:17:10,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:10,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:11,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:11,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-14 02:17:11,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:11,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:11,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:11,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,058 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:11,058 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:11,058 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:11,058 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:11,059 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:11,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:11,059 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:11,059 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:11,059 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:17:11,059 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:11,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:11,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:11,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:11,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:11,168 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:11,168 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:11,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:11,174 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:11,194 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:11,194 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:11,200 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:11,200 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:11,226 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:11,227 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:11,349 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:11,351 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:11,352 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:11,352 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:11,352 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:11,352 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:11,352 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:11,352 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:11,352 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:11,353 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:17:11,353 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:11,353 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:11,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:11,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:11,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-01-14 02:17:11,463 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:11,463 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:11,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:17:11,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:11,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:11,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:11,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:11,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:11,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:11,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:11,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:17:11,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:11,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:11,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:11,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:11,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:11,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:11,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:11,485 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:11,493 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:17:11,493 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:11,494 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:11,494 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:17:11,494 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:11,494 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-14 02:17:11,496 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:17:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:11,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:11,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:11,826 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-01-14 02:17:11,826 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-01-14 02:17:11,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 13 states and 18 transitions. Complement of second has 5 states. [2019-01-14 02:17:11,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:17:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:17:11,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-01-14 02:17:11,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:11,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 02:17:11,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:11,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:17:11,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:11,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2019-01-14 02:17:11,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:17:11,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 13 transitions. [2019-01-14 02:17:11,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:17:11,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:17:11,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-14 02:17:11,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:11,963 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:17:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-14 02:17:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2019-01-14 02:17:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:17:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-14 02:17:11,965 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:17:11,965 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:17:11,965 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:17:11,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2019-01-14 02:17:11,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:17:11,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:11,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:11,966 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-14 02:17:11,966 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:17:11,968 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 118#L17-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 119#L19-2 assume !(main_~y~0 < main_~x~0); 123#L19-3 main_~x~0 := main_~x~0 - 1; 120#L17-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 121#L19-2 [2019-01-14 02:17:11,968 INFO L796 eck$LassoCheckResult]: Loop: 121#L19-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; 121#L19-2 [2019-01-14 02:17:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:11,968 INFO L82 PathProgramCache]: Analyzing trace with hash 29867642, now seen corresponding path program 2 times [2019-01-14 02:17:11,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:11,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:11,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:11,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:11,985 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-14 02:17:11,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:11,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:11,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:11,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:11,996 INFO L82 PathProgramCache]: Analyzing trace with hash 925896921, now seen corresponding path program 1 times [2019-01-14 02:17:11,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:11,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:12,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:17:12,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:17:12,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:12,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:12,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:17:12,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 02:17:12,248 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:12,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:12,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:12,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:12,249 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:12,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:12,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:12,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:17:12,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:12,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:12,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:12,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:12,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:12,416 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:12,416 INFO L412 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,420 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:12,420 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:12,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:12,440 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} 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-01-14 02:17:12,445 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:12,445 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:12,464 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:12,465 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-14 02:17:12,470 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:12,470 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,495 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:12,495 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:12,624 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:12,626 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:12,626 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:12,626 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:12,626 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:12,626 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:12,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:12,627 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:12,627 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:17:12,627 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:12,627 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:12,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:12,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-01-14 02:17:12,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:12,751 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:12,752 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:12,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:17:12,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:12,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:12,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:12,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:12,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:12,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:12,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:12,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:17:12,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:12,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:12,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:12,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:12,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:12,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:12,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:12,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:17:12,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:12,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:12,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:12,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:12,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:12,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:12,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:12,780 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:12,787 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:17:12,787 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:12,787 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:12,788 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:17:12,788 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:12,788 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-14 02:17:12,788 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:17:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:12,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:12,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:12,844 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-01-14 02:17:12,844 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:17:12,874 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 15 transitions. Complement of second has 5 states. [2019-01-14 02:17:12,875 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-01-14 02:17:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:17:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:17:12,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:17:12,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:12,876 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:12,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:12,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:12,932 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-01-14 02:17:12,933 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:17:12,962 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 15 transitions. Complement of second has 5 states. [2019-01-14 02:17:12,963 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-01-14 02:17:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:17:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:17:12,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:17:12,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:12,964 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:13,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:13,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:13,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:13,030 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-01-14 02:17:13,031 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:17:13,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 9 states and 11 transitions. Complement of second has 4 states. [2019-01-14 02:17:13,049 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-01-14 02:17:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:17:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-14 02:17:13,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:17:13,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:13,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 02:17:13,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:13,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:17:13,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:13,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-14 02:17:13,054 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:17:13,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-14 02:17:13,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:17:13,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:17:13,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:17:13,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:17:13,055 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:13,056 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:13,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:17:13,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:17:13,060 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 7 states. [2019-01-14 02:17:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:17:13,063 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:17:13,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:17:13,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:17:13,063 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:17:13,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:17:13,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:17:13,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:17:13,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:17:13,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:17:13,064 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:13,064 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:13,064 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:13,064 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:17:13,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:17:13,065 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:17:13,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:17:13,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:17:13 BoogieIcfgContainer [2019-01-14 02:17:13,072 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:17:13,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:17:13,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:17:13,073 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:17:13,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:17:09" (3/4) ... [2019-01-14 02:17:13,078 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:17:13,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:17:13,079 INFO L168 Benchmark]: Toolchain (without parser) took 4808.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.3 MB in the beginning and 917.5 MB in the end (delta: 33.8 MB). Peak memory consumption was 162.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:13,081 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:13,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.83 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:13,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:13,083 INFO L168 Benchmark]: Boogie Preprocessor took 21.98 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:13,084 INFO L168 Benchmark]: RCFGBuilder took 464.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:13,086 INFO L168 Benchmark]: BuchiAutomizer took 3978.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 917.5 MB in the end (delta: 195.9 MB). Peak memory consumption was 195.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:13,086 INFO L168 Benchmark]: Witness Printer took 5.37 ms. Allocated memory is still 1.2 GB. Free memory is still 917.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:13,092 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.83 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.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 43.39 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.98 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 464.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3978.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 917.5 MB in the end (delta: 195.9 MB). Peak memory consumption was 195.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.37 ms. Allocated memory is still 1.2 GB. Free memory is still 917.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * y + x and consists of 3 locations. One nondeterministic module has affine ranking function -1 * y + x and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 21 SDslu, 6 SDs, 0 SdLazy, 39 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax203 hnf98 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf111 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...