./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/UrbanMine-ESOP2014-Fig3_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 835dc6725bef5f7d15ae0e4368f1a97f9d2b8c09 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:34:52,221 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:34:52,223 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:34:52,236 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:34:52,237 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:34:52,238 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:34:52,241 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:34:52,243 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:34:52,246 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:34:52,249 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:34:52,252 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:34:52,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:34:52,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:34:52,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:34:52,260 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:34:52,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:34:52,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:34:52,264 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:34:52,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:34:52,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:34:52,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:34:52,275 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:34:52,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:34:52,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:34:52,279 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:34:52,280 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:34:52,286 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:34:52,287 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:34:52,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:34:52,292 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:34:52,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:34:52,296 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:34:52,296 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:34:52,296 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:34:52,297 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:34:52,298 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:34:52,298 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:34:52,330 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:34:52,331 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:34:52,335 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:34:52,335 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:34:52,336 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:34:52,336 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:34:52,336 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:34:52,336 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:34:52,336 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:34:52,337 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:34:52,337 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:34:52,337 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:34:52,337 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:34:52,337 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:34:52,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:34:52,338 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:34:52,338 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:34:52,338 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:34:52,338 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:34:52,338 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:34:52,338 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:34:52,339 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:34:52,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:34:52,339 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:34:52,339 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:34:52,339 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:34:52,341 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:34:52,341 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:34:52,344 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:34:52,344 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 -> 835dc6725bef5f7d15ae0e4368f1a97f9d2b8c09 [2019-01-01 21:34:52,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:34:52,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:34:52,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:34:52,419 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:34:52,419 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:34:52,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c [2019-01-01 21:34:52,498 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7075d49a5/05b1c8e316514c0dbb4c88a1efc48cde/FLAG699bffbcb [2019-01-01 21:34:52,917 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:34:52,918 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c [2019-01-01 21:34:52,924 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7075d49a5/05b1c8e316514c0dbb4c88a1efc48cde/FLAG699bffbcb [2019-01-01 21:34:53,298 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7075d49a5/05b1c8e316514c0dbb4c88a1efc48cde [2019-01-01 21:34:53,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:34:53,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:34:53,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:34:53,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:34:53,308 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:34:53,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ed9335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53, skipping insertion in model container [2019-01-01 21:34:53,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:34:53,345 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:34:53,583 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:34:53,590 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:34:53,618 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:34:53,639 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:34:53,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53 WrapperNode [2019-01-01 21:34:53,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:34:53,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:34:53,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:34:53,641 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:34:53,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:34:53,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:34:53,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:34:53,688 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:34:53,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:34:53,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:34:53,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:34:53,721 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:34:53,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (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-01 21:34:53,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:34:53,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:34:54,180 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:34:54,180 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:34:54,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:54 BoogieIcfgContainer [2019-01-01 21:34:54,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:34:54,182 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:34:54,183 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:34:54,187 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:34:54,189 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:54,189 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:34:53" (1/3) ... [2019-01-01 21:34:54,191 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42ee27eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:34:54, skipping insertion in model container [2019-01-01 21:34:54,191 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:54,191 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (2/3) ... [2019-01-01 21:34:54,193 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42ee27eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:34:54, skipping insertion in model container [2019-01-01 21:34:54,193 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:54,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:54" (3/3) ... [2019-01-01 21:34:54,197 INFO L375 chiAutomizerObserver]: Analyzing ICFG UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c [2019-01-01 21:34:54,339 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:34:54,340 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:34:54,340 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:34:54,340 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:34:54,344 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:34:54,344 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:34:54,345 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:34:54,345 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:34:54,345 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:34:54,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-01 21:34:54,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:34:54,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:54,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:54,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:54,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:34:54,425 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:34:54,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-01 21:34:54,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:34:54,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:54,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:54,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:54,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:34:54,436 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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; 10#L27-2true [2019-01-01 21:34:54,437 INFO L796 eck$LassoCheckResult]: Loop: 10#L27-2true assume !!(0 != main_~x~0 && main_~y~0 > 0); 7#L19true assume !(main_~x~0 > 0); 5#L27true assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~x~0 := 1 + main_~x~0; 10#L27-2true [2019-01-01 21:34:54,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,444 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:34:54,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:54,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:54,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:54,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash 40076, now seen corresponding path program 1 times [2019-01-01 21:34:54,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:54,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:54,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash 963597, now seen corresponding path program 1 times [2019-01-01 21:34:54,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:54,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:54,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:54,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,723 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:54,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:54,725 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:54,725 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:54,725 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:54,725 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,725 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:54,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:54,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:34:54,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:54,726 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:54,756 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-01 21:34:54,781 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-01 21:34:54,798 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-01 21:34:54,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:54,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:55,247 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:55,248 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) [2019-01-01 21:34:55,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:55,264 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:55,305 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:55,305 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-01 21:34:55,316 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:55,316 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:55,341 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:55,341 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-01 21:34:55,348 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:55,348 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:55,369 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:55,370 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 21:34:55,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:55,378 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:55,383 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:55,383 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01 21:34:55,407 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:55,407 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01 21:34:55,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:55,437 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:55,468 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:55,470 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:55,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:55,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:55,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:55,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:55,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:55,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:55,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:55,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:34:55,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:55,472 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:55,476 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-01 21:34:55,488 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-01 21:34:55,494 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-01 21:34:55,539 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-01 21:34:55,585 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-01 21:34:55,711 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 21:34:56,117 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-01 21:34:56,209 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:56,214 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:56,217 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-01 21:34:56,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:56,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:56,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:56,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:56,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:56,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:56,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:56,237 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-01 21:34:56,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:56,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:56,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:56,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:56,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:56,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:56,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:56,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:56,245 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-01 21:34:56,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:56,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:56,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:56,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:56,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:56,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:56,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:56,262 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-01 21:34:56,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:56,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:56,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:56,263 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:34:56,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:56,266 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:34:56,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:56,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:56,275 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-01 21:34:56,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:56,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:56,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:56,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:56,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:56,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:56,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:56,286 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:56,292 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:56,292 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:56,295 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:56,295 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:56,296 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:56,296 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:34:56,299 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:56,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:56,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:56,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:56,419 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-01 21:34:56,434 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-01 21:34:56,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2019-01-01 21:34:56,782 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 4 states. Result 33 states and 49 transitions. Complement of second has 8 states. [2019-01-01 21:34:56,784 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-01 21:34:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-01 21:34:56,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-01 21:34:56,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:56,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:34:56,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:56,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-01 21:34:56,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:56,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 49 transitions. [2019-01-01 21:34:56,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 21:34:56,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 16 states and 25 transitions. [2019-01-01 21:34:56,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:34:56,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:34:56,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 25 transitions. [2019-01-01 21:34:56,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:56,807 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. [2019-01-01 21:34:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 25 transitions. [2019-01-01 21:34:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-01 21:34:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:34:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2019-01-01 21:34:56,841 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2019-01-01 21:34:56,841 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2019-01-01 21:34:56,842 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:34:56,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 23 transitions. [2019-01-01 21:34:56,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 21:34:56,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:56,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:56,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:34:56,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:34:56,845 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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; 83#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 94#L19 [2019-01-01 21:34:56,845 INFO L796 eck$LassoCheckResult]: Loop: 94#L19 assume main_~x~0 > 0; 95#L20 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := main_~y~0 - 1; 96#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 94#L19 [2019-01-01 21:34:56,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 21:34:56,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:56,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:56,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:56,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash 42852, now seen corresponding path program 1 times [2019-01-01 21:34:56,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:56,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:56,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:56,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,879 INFO L82 PathProgramCache]: Analyzing trace with hash 29863643, now seen corresponding path program 1 times [2019-01-01 21:34:56,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:56,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:56,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:56,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,942 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:56,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:56,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:56,942 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:56,942 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:56,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:56,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:56,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:56,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:34:56,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:56,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:56,947 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-01 21:34:56,956 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-01 21:34:56,964 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-01 21:34:56,971 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-01 21:34:56,983 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-01 21:34:57,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:57,155 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01 21:34:57,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:57,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:57,182 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:57,183 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:57,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:57,192 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:57,214 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:57,214 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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-01 21:34:57,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:57,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:57,224 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:57,225 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=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-01-01 21:34:57,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:57,246 INFO L163 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-01-01 21:34:57,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:57,271 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:57,329 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:57,332 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:57,332 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:57,332 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:57,332 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:57,333 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:57,333 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:57,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:57,333 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:57,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:34:57,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:57,333 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:57,335 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-01 21:34:57,342 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-01 21:34:57,347 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-01 21:34:57,352 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-01 21:34:57,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-01-01 21:34:57,855 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:57,855 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:57,856 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-01 21:34:57,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:57,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:57,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:57,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:57,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:57,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:57,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:57,880 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-01 21:34:57,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:57,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:57,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:57,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:57,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:57,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:57,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:57,904 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-01 21:34:57,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:57,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:57,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:57,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:57,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:57,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:57,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:57,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:57,918 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-01 21:34:57,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:57,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:57,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:57,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:57,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:57,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:57,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:57,939 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:57,949 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:57,949 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:57,950 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:57,950 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:57,950 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:57,950 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:34:57,953 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:57,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:58,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:58,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:58,035 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-01 21:34:58,035 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-01 21:34:58,036 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 23 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 21:34:58,095 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 23 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 42 states and 70 transitions. Complement of second has 7 states. [2019-01-01 21:34:58,096 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-01-01 21:34:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:34:58,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-01 21:34:58,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:34:58,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 21:34:58,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 70 transitions. [2019-01-01 21:34:58,103 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 21:34:58,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 36 states and 56 transitions. [2019-01-01 21:34:58,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:34:58,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:34:58,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 56 transitions. [2019-01-01 21:34:58,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:58,106 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 56 transitions. [2019-01-01 21:34:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 56 transitions. [2019-01-01 21:34:58,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-01-01 21:34:58,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 21:34:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 52 transitions. [2019-01-01 21:34:58,112 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 52 transitions. [2019-01-01 21:34:58,112 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 52 transitions. [2019-01-01 21:34:58,113 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:34:58,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 52 transitions. [2019-01-01 21:34:58,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 21:34:58,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:58,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:58,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:34:58,115 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:34:58,116 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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; 179#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 189#L19 assume main_~x~0 > 0; 185#L20 assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1;main_~y~0 := main_#t~nondet3;havoc main_#t~nondet3; 192#L27-2 [2019-01-01 21:34:58,116 INFO L796 eck$LassoCheckResult]: Loop: 192#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 209#L19 assume !(main_~x~0 > 0); 208#L27 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~x~0 := 1 + main_~x~0; 192#L27-2 [2019-01-01 21:34:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash 963341, now seen corresponding path program 1 times [2019-01-01 21:34:58,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:58,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:58,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,138 INFO L82 PathProgramCache]: Analyzing trace with hash 40076, now seen corresponding path program 2 times [2019-01-01 21:34:58,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:58,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:58,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:58,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1365869056, now seen corresponding path program 1 times [2019-01-01 21:34:58,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:58,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:58,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:58,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:34:58,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:34:58,302 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:58,302 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:58,302 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:58,303 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:58,303 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:58,303 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:58,303 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:58,303 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:58,303 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:34:58,303 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:58,304 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:58,305 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-01 21:34:58,311 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-01 21:34:58,340 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-01 21:34:58,356 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-01 21:34:58,375 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-01 21:34:58,550 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:58,551 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01 21:34:58,555 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:58,555 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:58,577 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:58,577 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:58,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:58,585 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:58,588 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:58,589 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:58,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:58,611 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:58,631 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:58,631 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:58,637 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:58,637 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:58,660 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:58,660 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:58,688 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:58,690 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:58,690 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:58,690 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:58,690 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:58,690 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:58,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:58,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:58,691 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:58,691 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:34:58,691 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:58,691 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:58,693 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-01 21:34:58,701 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-01 21:34:58,709 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-01 21:34:58,712 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-01 21:34:58,725 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-01 21:34:58,899 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:58,899 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:58,900 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-01 21:34:58,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:58,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:58,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:58,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:58,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:58,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:58,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:58,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:58,903 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-01 21:34:58,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:58,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:58,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:58,904 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:34:58,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:58,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:34:58,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:58,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:58,914 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-01 21:34:58,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:58,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:58,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:58,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:58,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:58,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:58,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:58,921 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-01 21:34:58,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:58,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:58,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:58,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:58,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:58,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:58,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:58,928 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:58,931 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:58,932 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:58,932 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:58,932 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:58,932 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:58,933 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:34:58,935 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:58,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:58,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:58,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:58,989 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-01 21:34:58,989 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 52 transitions. cyclomatic complexity: 26 Second operand 4 states. [2019-01-01 21:34:59,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 52 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 43 states and 69 transitions. Complement of second has 7 states. [2019-01-01 21:34:59,036 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-01-01 21:34:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 21:34:59,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:34:59,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:59,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:34:59,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:59,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:34:59,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:59,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 69 transitions. [2019-01-01 21:34:59,040 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-01 21:34:59,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 69 transitions. [2019-01-01 21:34:59,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:34:59,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 21:34:59,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 69 transitions. [2019-01-01 21:34:59,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:59,042 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 69 transitions. [2019-01-01 21:34:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 69 transitions. [2019-01-01 21:34:59,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-01 21:34:59,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 21:34:59,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 67 transitions. [2019-01-01 21:34:59,048 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 67 transitions. [2019-01-01 21:34:59,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:34:59,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:34:59,054 INFO L87 Difference]: Start difference. First operand 42 states and 67 transitions. Second operand 4 states. [2019-01-01 21:34:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:34:59,107 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2019-01-01 21:34:59,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:34:59,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2019-01-01 21:34:59,110 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-01 21:34:59,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 36 states and 53 transitions. [2019-01-01 21:34:59,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 21:34:59,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:34:59,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 53 transitions. [2019-01-01 21:34:59,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:59,114 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-01-01 21:34:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 53 transitions. [2019-01-01 21:34:59,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-01 21:34:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 21:34:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. [2019-01-01 21:34:59,118 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 43 transitions. [2019-01-01 21:34:59,118 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 43 transitions. [2019-01-01 21:34:59,118 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:34:59,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 43 transitions. [2019-01-01 21:34:59,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:34:59,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:59,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:59,122 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:34:59,122 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:34:59,122 INFO L794 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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; 385#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 410#L19 assume main_~x~0 > 0; 395#L20 assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1;main_~y~0 := main_#t~nondet3;havoc main_#t~nondet3; 393#L27-2 [2019-01-01 21:34:59,122 INFO L796 eck$LassoCheckResult]: Loop: 393#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 390#L19 assume main_~x~0 > 0; 391#L20 assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1;main_~y~0 := main_#t~nondet3;havoc main_#t~nondet3; 393#L27-2 [2019-01-01 21:34:59,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash 963341, now seen corresponding path program 2 times [2019-01-01 21:34:59,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:59,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:59,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:59,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:59,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:59,140 INFO L82 PathProgramCache]: Analyzing trace with hash 39820, now seen corresponding path program 1 times [2019-01-01 21:34:59,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:59,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:59,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:59,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:59,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:59,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1365869312, now seen corresponding path program 3 times [2019-01-01 21:34:59,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:59,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:59,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:59,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:59,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,243 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:59,243 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:59,243 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:59,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:59,244 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:59,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:59,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:59,244 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:59,244 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:34:59,244 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:59,244 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:59,246 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-01 21:34:59,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-01-01 21:34:59,263 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-01 21:34:59,275 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-01 21:34:59,279 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-01 21:34:59,346 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:59,347 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01-01 21:34:59,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:59,354 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:59,373 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:59,374 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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-01-01 21:34:59,403 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:59,403 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:59,414 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:59,414 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=5, ULTIMATE.start_main_#t~nondet3=5} Honda state: {ULTIMATE.start_main_~y~0=5, ULTIMATE.start_main_#t~nondet3=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:59,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:59,436 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:59,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:59,462 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:59,487 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:59,489 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:59,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:59,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:59,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:59,489 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:59,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:59,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:59,489 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:59,489 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:34:59,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:59,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:59,492 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-01 21:34:59,509 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-01 21:34:59,512 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-01 21:34:59,518 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-01 21:34:59,526 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-01 21:34:59,627 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:59,628 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:59,628 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-01 21:34:59,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:59,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:59,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:59,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:59,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:59,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:59,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:59,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:59,638 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-01 21:34:59,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:59,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:59,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:59,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:59,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:59,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:59,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:59,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:59,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:59,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:59,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:59,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:59,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:59,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:59,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:59,663 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:59,672 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:59,672 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:59,672 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:59,672 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:59,673 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:59,673 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:34:59,673 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:59,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:59,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:59,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:59,743 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-01 21:34:59,744 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-01 21:34:59,744 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 43 transitions. cyclomatic complexity: 21 Second operand 4 states. [2019-01-01 21:34:59,770 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 43 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 35 states and 52 transitions. Complement of second has 6 states. [2019-01-01 21:34:59,771 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-01-01 21:34:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 21:34:59,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:34:59,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:59,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:34:59,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:59,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:34:59,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:59,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 52 transitions. [2019-01-01 21:34:59,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:34:59,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 52 transitions. [2019-01-01 21:34:59,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:34:59,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:34:59,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 52 transitions. [2019-01-01 21:34:59,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:59,776 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-01-01 21:34:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 52 transitions. [2019-01-01 21:34:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-01-01 21:34:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 21:34:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2019-01-01 21:34:59,783 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2019-01-01 21:34:59,783 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2019-01-01 21:34:59,783 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:34:59,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 50 transitions. [2019-01-01 21:34:59,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:34:59,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:59,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:59,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-01 21:34:59,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:34:59,786 INFO L794 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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; 492#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 518#L19 assume main_~x~0 > 0; 498#L20 assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1;main_~y~0 := main_#t~nondet3;havoc main_#t~nondet3; 521#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 502#L19 [2019-01-01 21:34:59,786 INFO L796 eck$LassoCheckResult]: Loop: 502#L19 assume main_~x~0 > 0; 504#L20 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := main_~y~0 - 1; 501#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 502#L19 [2019-01-01 21:34:59,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash 29863581, now seen corresponding path program 4 times [2019-01-01 21:34:59,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:59,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:59,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:59,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:59,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:59,812 INFO L82 PathProgramCache]: Analyzing trace with hash 42852, now seen corresponding path program 2 times [2019-01-01 21:34:59,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:59,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:59,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:59,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:59,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:59,829 INFO L82 PathProgramCache]: Analyzing trace with hash 607724360, now seen corresponding path program 1 times [2019-01-01 21:34:59,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:59,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:59,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:59,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,939 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:59,940 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:59,940 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:59,940 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:59,940 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:59,940 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:59,940 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:59,940 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:59,940 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:34:59,941 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:59,941 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:59,942 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-01 21:34:59,983 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-01 21:34:59,987 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-01 21:34:59,992 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-01 21:34:59,995 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-01 21:35:00,045 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:35:00,045 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:00,048 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:35:00,048 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:35:00,051 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:35:00,052 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:00,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:35:00,074 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:00,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:35:00,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:35:00,154 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:35:00,156 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:35:00,156 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:35:00,156 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:35:00,157 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:35:00,157 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:35:00,157 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:00,157 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:35:00,157 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:35:00,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:35:00,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:35:00,157 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:35:00,158 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-01 21:35:00,165 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-01 21:35:00,169 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-01 21:35:00,172 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-01 21:35:00,175 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-01 21:35:00,225 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:35:00,225 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:35:00,226 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-01 21:35:00,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:00,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:00,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:00,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:00,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:00,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:00,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:00,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:00,237 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-01 21:35:00,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:00,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:00,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:00,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:00,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:00,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:00,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:00,246 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:35:00,252 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:35:00,252 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:35:00,252 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:35:00,253 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:35:00,253 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:35:00,253 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:35:00,253 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:35:00,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:00,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:00,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:00,371 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-01 21:35:00,371 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-01 21:35:00,371 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 24 Second operand 4 states. [2019-01-01 21:35:00,413 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 24. Second operand 4 states. Result 57 states and 89 transitions. Complement of second has 7 states. [2019-01-01 21:35:00,415 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-01-01 21:35:00,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:35:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:35:00,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:35:00,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:00,416 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:35:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:00,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:00,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:00,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-01-01 21:35:00,459 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-01-01 21:35:00,460 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 24 Second operand 4 states. [2019-01-01 21:35:00,487 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 24. Second operand 4 states. Result 57 states and 89 transitions. Complement of second has 7 states. [2019-01-01 21:35:00,487 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-01-01 21:35:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:35:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:35:00,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:35:00,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:00,488 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:35:00,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:00,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:00,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:00,517 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-01 21:35:00,518 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-01-01 21:35:00,518 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 24 Second operand 4 states. [2019-01-01 21:35:00,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 24. Second operand 4 states. Result 59 states and 92 transitions. Complement of second has 8 states. [2019-01-01 21:35:00,580 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-01-01 21:35:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:35:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 21:35:00,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:35:00,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:00,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 21:35:00,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:00,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-01 21:35:00,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:00,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 92 transitions. [2019-01-01 21:35:00,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:00,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 17 states and 21 transitions. [2019-01-01 21:35:00,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:35:00,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:35:00,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-01-01 21:35:00,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:35:00,585 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-01 21:35:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-01-01 21:35:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-01-01 21:35:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:35:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-01-01 21:35:00,587 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-01 21:35:00,587 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-01 21:35:00,588 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:35:00,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-01-01 21:35:00,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:00,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:00,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:00,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2019-01-01 21:35:00,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:35:00,589 INFO L794 eck$LassoCheckResult]: Stem: 812#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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; 813#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 818#L19 assume !(main_~x~0 > 0); 819#L27 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;main_~y~0 := main_~y~0 - 1;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 825#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 823#L19 assume !(main_~x~0 > 0); 814#L27 [2019-01-01 21:35:00,589 INFO L796 eck$LassoCheckResult]: Loop: 814#L27 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~x~0 := 1 + main_~x~0; 815#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 824#L19 assume !(main_~x~0 > 0); 814#L27 [2019-01-01 21:35:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:00,589 INFO L82 PathProgramCache]: Analyzing trace with hash 926018970, now seen corresponding path program 1 times [2019-01-01 21:35:00,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:00,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:00,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:00,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:00,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:00,605 INFO L82 PathProgramCache]: Analyzing trace with hash 53186, now seen corresponding path program 3 times [2019-01-01 21:35:00,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:00,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:00,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:00,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:00,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:00,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash 456216457, now seen corresponding path program 1 times [2019-01-01 21:35:00,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:00,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:00,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:00,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:35:00,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:00,687 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:35:00,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:35:00,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:35:00,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:35:00,688 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:35:00,688 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:00,688 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:35:00,688 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:35:00,689 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:35:00,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:35:00,689 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:35:00,691 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-01 21:35:00,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:00,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-01-01 21:35:00,701 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-01 21:35:00,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:00,811 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:35:00,812 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:00,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:35:00,819 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:35:00,826 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:35:00,826 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:00,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:35:00,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:35:00,867 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:35:00,867 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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-01-01 21:35:00,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:35:00,871 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:35:00,891 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:35:00,891 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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-01-01 21:35:00,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:35:00,896 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:35:00,915 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:35:00,916 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:00,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:35:00,920 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:00,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:35:00,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:35:01,014 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:35:01,016 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:35:01,016 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:35:01,016 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:35:01,016 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:35:01,016 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:35:01,016 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:01,016 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:35:01,016 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:35:01,016 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:35:01,017 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:35:01,017 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:35:01,018 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-01 21:35:01,025 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-01 21:35:01,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:01,034 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-01 21:35:01,052 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-01 21:35:01,185 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:35:01,185 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:35:01,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:01,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:01,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:01,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:01,190 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:35:01,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:01,191 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:35:01,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:01,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:01,196 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-01 21:35:01,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:01,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:01,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:01,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:01,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:01,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:01,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:01,207 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-01 21:35:01,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:01,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:01,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:01,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:01,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:01,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:01,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:01,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:01,215 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-01 21:35:01,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:01,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:01,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:01,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:01,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:01,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:01,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:01,223 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:35:01,226 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:35:01,227 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:35:01,227 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:35:01,227 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:35:01,228 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:35:01,228 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:35:01,228 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:35:01,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:01,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:01,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:01,323 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-01 21:35:01,323 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-01 21:35:01,324 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:35:01,347 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 22 states and 26 transitions. Complement of second has 5 states. [2019-01-01 21:35:01,349 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-01 21:35:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:35:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:35:01,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:35:01,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:01,350 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:35:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:01,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:01,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:01,405 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-01 21:35:01,406 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-01-01 21:35:01,406 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:35:01,431 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 22 states and 26 transitions. Complement of second has 5 states. [2019-01-01 21:35:01,433 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-01 21:35:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:35:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:35:01,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:35:01,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:01,434 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:35:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:01,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:01,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:01,476 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-01 21:35:01,476 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-01-01 21:35:01,477 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:35:01,499 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 27 states and 32 transitions. Complement of second has 4 states. [2019-01-01 21:35:01,502 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-01 21:35:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:35:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:35:01,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:35:01,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:01,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 21:35:01,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:01,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 21:35:01,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:01,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-01-01 21:35:01,505 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:35:01,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-01-01 21:35:01,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:35:01,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:35:01,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:35:01,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:35:01,505 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:35:01,505 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:35:01,505 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:35:01,506 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:35:01,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:35:01,506 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:35:01,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:35:01,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:35:01 BoogieIcfgContainer [2019-01-01 21:35:01,514 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:35:01,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:35:01,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:35:01,515 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:35:01,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:54" (3/4) ... [2019-01-01 21:35:01,520 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:35:01,520 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:35:01,521 INFO L168 Benchmark]: Toolchain (without parser) took 8218.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 951.3 MB in the beginning and 991.4 MB in the end (delta: -40.1 MB). Peak memory consumption was 173.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:01,522 INFO L168 Benchmark]: CDTParser took 0.18 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-01 21:35:01,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.45 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-01 21:35:01,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.92 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-01 21:35:01,524 INFO L168 Benchmark]: Boogie Preprocessor took 33.38 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-01 21:35:01,524 INFO L168 Benchmark]: RCFGBuilder took 460.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:01,525 INFO L168 Benchmark]: BuchiAutomizer took 7331.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 991.4 MB in the end (delta: 139.1 MB). Peak memory consumption was 199.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:01,526 INFO L168 Benchmark]: Witness Printer took 5.60 ms. Allocated memory is still 1.2 GB. Free memory is still 991.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:35:01,530 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.18 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 336.45 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 45.92 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 33.38 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 460.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7331.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 991.4 MB in the end (delta: 139.1 MB). Peak memory consumption was 199.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.60 ms. Allocated memory is still 1.2 GB. Free memory is still 991.4 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 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * x and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function -1 * x and consists of 4 locations. One deterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 76 SDtfs, 73 SDslu, 32 SDs, 0 SdLazy, 117 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax162 hnf98 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq165 hnf94 smp84 dnf100 smp100 tf112 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...