./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/a.10_true-termination.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-restricted-15/a.10_true-termination.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 8d0216d6bf8bf4f618f739d27f28d08a28da9c3b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:20:34,523 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:20:34,525 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:20:34,537 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:20:34,538 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:20:34,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:20:34,540 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:20:34,542 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:20:34,544 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:20:34,545 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:20:34,546 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:20:34,546 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:20:34,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:20:34,549 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:20:34,550 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:20:34,551 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:20:34,552 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:20:34,554 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:20:34,556 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:20:34,558 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:20:34,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:20:34,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:20:34,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:20:34,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:20:34,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:20:34,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:20:34,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:20:34,567 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:20:34,569 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:20:34,570 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:20:34,570 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:20:34,571 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:20:34,571 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:20:34,571 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:20:34,573 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:20:34,574 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:20:34,574 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:20:34,591 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:20:34,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:20:34,593 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:20:34,593 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:20:34,593 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:20:34,593 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:20:34,594 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:20:34,594 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:20:34,594 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:20:34,594 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:20:34,594 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:20:34,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:20:34,596 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:20:34,596 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:20:34,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:20:34,596 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:20:34,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:20:34,597 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:20:34,597 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:20:34,598 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:20:34,598 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:20:34,598 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:20:34,598 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:20:34,598 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:20:34,599 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:20:34,599 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:20:34,599 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:20:34,599 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:20:34,601 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:20:34,601 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 -> 8d0216d6bf8bf4f618f739d27f28d08a28da9c3b [2019-01-14 02:20:34,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:20:34,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:20:34,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:20:34,657 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:20:34,657 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:20:34,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/a.10_true-termination.c [2019-01-14 02:20:34,718 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fcfefea6/5b426d38dc3c4008be369a7440832336/FLAG5416a615b [2019-01-14 02:20:35,167 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:20:35,168 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/a.10_true-termination.c [2019-01-14 02:20:35,174 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fcfefea6/5b426d38dc3c4008be369a7440832336/FLAG5416a615b [2019-01-14 02:20:35,536 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fcfefea6/5b426d38dc3c4008be369a7440832336 [2019-01-14 02:20:35,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:20:35,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:20:35,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:20:35,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:20:35,546 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:20:35,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:20:35" (1/1) ... [2019-01-14 02:20:35,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9a6a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35, skipping insertion in model container [2019-01-14 02:20:35,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:20:35" (1/1) ... [2019-01-14 02:20:35,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:20:35,579 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:20:35,777 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:20:35,782 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:20:35,801 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:20:35,818 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:20:35,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35 WrapperNode [2019-01-14 02:20:35,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:20:35,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:20:35,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:20:35,821 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:20:35,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35" (1/1) ... [2019-01-14 02:20:35,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35" (1/1) ... [2019-01-14 02:20:35,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:20:35,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:20:35,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:20:35,864 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:20:35,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35" (1/1) ... [2019-01-14 02:20:35,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35" (1/1) ... [2019-01-14 02:20:35,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35" (1/1) ... [2019-01-14 02:20:35,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35" (1/1) ... [2019-01-14 02:20:35,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35" (1/1) ... [2019-01-14 02:20:35,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35" (1/1) ... [2019-01-14 02:20:35,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35" (1/1) ... [2019-01-14 02:20:35,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:20:35,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:20:35,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:20:35,897 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:20:35,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:20:36,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:20:36,284 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:20:36,285 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:20:36,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:20:36 BoogieIcfgContainer [2019-01-14 02:20:36,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:20:36,287 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:20:36,287 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:20:36,291 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:20:36,291 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:20:36,291 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:20:35" (1/3) ... [2019-01-14 02:20:36,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b04d506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:20:36, skipping insertion in model container [2019-01-14 02:20:36,293 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:20:36,293 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:20:35" (2/3) ... [2019-01-14 02:20:36,293 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b04d506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:20:36, skipping insertion in model container [2019-01-14 02:20:36,293 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:20:36,293 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:20:36" (3/3) ... [2019-01-14 02:20:36,295 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.10_true-termination.c [2019-01-14 02:20:36,362 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:20:36,364 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:20:36,364 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:20:36,364 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:20:36,364 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:20:36,364 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:20:36,365 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:20:36,365 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:20:36,365 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:20:36,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:20:36,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:20:36,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:20:36,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:20:36,413 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:20:36,414 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:20:36,414 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:20:36,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:20:36,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:20:36,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:20:36,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:20:36,416 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:20:36,416 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:20:36,425 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~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;main_~c~0 := 0; 3#L12-2true [2019-01-14 02:20:36,426 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!!(main_~x~0 == main_~y~0); 5#L12true assume main_~x~0 > main_~y~0;main_~y~0 := 1 + main_~y~0; 3#L12-2true [2019-01-14 02:20:36,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:36,433 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:20:36,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:20:36,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:20:36,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:36,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:20:36,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:36,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-14 02:20:36,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:20:36,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:20:36,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:36,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:20:36,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:36,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:36,542 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-14 02:20:36,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:20:36,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:20:36,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:36,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:20:36,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:36,713 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-14 02:20:36,767 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:20:36,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:20:36,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:20:36,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:20:36,769 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:20:36,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:36,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:20:36,769 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:20:36,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10_true-termination.c_Iteration1_Loop [2019-01-14 02:20:36,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:20:36,770 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:20:36,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:36,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:36,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:37,019 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:20:37,020 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:37,026 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:20:37,026 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:20:37,055 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:20:37,055 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: [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:37,067 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:20:37,067 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:20:37,091 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:20:37,091 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:37,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:20:37,096 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:37,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:20:37,127 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:20:37,267 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:20:37,269 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:20:37,270 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:20:37,270 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:20:37,270 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:20:37,270 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:20:37,270 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:37,270 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:20:37,270 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:20:37,271 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10_true-termination.c_Iteration1_Loop [2019-01-14 02:20:37,271 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:20:37,271 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:20:37,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:37,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:37,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:37,609 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:20:37,615 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:20:37,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:20:37,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:20:37,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:20:37,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:20:37,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:20:37,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:20:37,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:20:37,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:20:37,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:20:37,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:20:37,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:20:37,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:20:37,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:20:37,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:20:37,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:20:37,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:20:37,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:20:37,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:20:37,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:20:37,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:20:37,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:20:37,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:20:37,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:20:37,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:20:37,684 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:20:37,697 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:20:37,701 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:20:37,704 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:20:37,704 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:20:37,704 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:20:37,705 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~x~0 - 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-14 02:20:37,706 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:20:37,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:37,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:37,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:20:37,844 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:20:37,846 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-14 02:20:38,025 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2019-01-14 02:20:38,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:20:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:20:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 02:20:38,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-14 02:20:38,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:38,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:20:38,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:38,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 02:20:38,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:38,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-14 02:20:38,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:20:38,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-14 02:20:38,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:20:38,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:20:38,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-14 02:20:38,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:20:38,056 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:20:38,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-14 02:20:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 02:20:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:20:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:20:38,094 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:20:38,094 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:20:38,094 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:20:38,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-14 02:20:38,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:20:38,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:20:38,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:20:38,097 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:20:38,098 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:20:38,099 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~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;main_~c~0 := 0; 69#L12-2 assume !!!(main_~x~0 == main_~y~0); 67#L12 assume !(main_~x~0 > main_~y~0);main_~x~0 := 1 + main_~x~0; 63#L12-2 [2019-01-14 02:20:38,100 INFO L796 eck$LassoCheckResult]: Loop: 63#L12-2 assume !!!(main_~x~0 == main_~y~0); 64#L12 assume main_~x~0 > main_~y~0;main_~y~0 := 1 + main_~y~0; 63#L12-2 [2019-01-14 02:20:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-14 02:20:38,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:20:38,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:20:38,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:38,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:20:38,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:38,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:38,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-01-14 02:20:38,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:20:38,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:20:38,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:38,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:20:38,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:38,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:38,135 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-01-14 02:20:38,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:20:38,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:20:38,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:38,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:20:38,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:20:38,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:20:38,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:20:38,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:20:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:38,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:20:38,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:20:38,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 02:20:38,358 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:20:38,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:20:38,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:20:38,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:20:38,358 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:20:38,359 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:38,359 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:20:38,359 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:20:38,359 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10_true-termination.c_Iteration2_Loop [2019-01-14 02:20:38,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:20:38,359 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:20:38,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:38,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:38,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:38,558 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:20:38,558 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:38,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:20:38,564 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:20:38,584 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:20:38,584 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:38,590 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:20:38,590 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-14 02:20:38,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:20:38,616 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:20:38,733 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:20:38,736 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:20:38,736 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:20:38,736 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:20:38,736 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:20:38,736 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:20:38,736 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:38,736 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:20:38,737 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:20:38,739 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10_true-termination.c_Iteration2_Loop [2019-01-14 02:20:38,739 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:20:38,739 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:20:38,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:38,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:38,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:38,898 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:20:38,898 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:20:38,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:20:38,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:20:38,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:20:38,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:20:38,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:20:38,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:20:38,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:20:38,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:20:38,908 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:20:38,912 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:20:38,913 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:20:38,913 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:20:38,913 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:20:38,914 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:20:38,914 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-14 02:20:38,914 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:20:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:39,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:39,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:20:39,019 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:20:39,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:20:39,119 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-01-14 02:20:39,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:20:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:20:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:20:39,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:20:39,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:39,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:20:39,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:39,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-14 02:20:39,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:39,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-01-14 02:20:39,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:20:39,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:20:39,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:20:39,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:20:39,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-14 02:20:39,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:20:39,129 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:20:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-14 02:20:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 02:20:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:20:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:20:39,134 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:20:39,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:20:39,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:20:39,141 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 4 states. [2019-01-14 02:20:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:20:39,383 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-14 02:20:39,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:20:39,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-01-14 02:20:39,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:20:39,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 11 transitions. [2019-01-14 02:20:39,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:20:39,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:20:39,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-14 02:20:39,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:20:39,388 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-14 02:20:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-14 02:20:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2019-01-14 02:20:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:20:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-14 02:20:39,391 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:20:39,391 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:20:39,391 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:20:39,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2019-01-14 02:20:39,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:20:39,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:20:39,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:20:39,393 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:20:39,393 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:20:39,395 INFO L794 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~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;main_~c~0 := 0; 158#L12-2 assume !!!(main_~x~0 == main_~y~0); 154#L12 [2019-01-14 02:20:39,395 INFO L796 eck$LassoCheckResult]: Loop: 154#L12 assume !(main_~x~0 > main_~y~0);main_~x~0 := 1 + main_~x~0; 153#L12-2 assume !!!(main_~x~0 == main_~y~0); 154#L12 [2019-01-14 02:20:39,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:20:39,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:20:39,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:20:39,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:39,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:20:39,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:39,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 1 times [2019-01-14 02:20:39,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:20:39,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:20:39,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:39,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:20:39,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:39,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:39,414 INFO L82 PathProgramCache]: Analyzing trace with hash 963397, now seen corresponding path program 2 times [2019-01-14 02:20:39,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:20:39,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:20:39,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:39,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:20:39,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:39,466 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:20:39,466 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:20:39,466 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:20:39,467 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:20:39,467 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:20:39,467 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:39,467 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:20:39,467 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:20:39,467 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10_true-termination.c_Iteration3_Loop [2019-01-14 02:20:39,467 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:20:39,467 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:20:39,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:39,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:39,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:39,641 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:20:39,642 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:39,645 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:20:39,645 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:39,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:20:39,676 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:20:41,943 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:20:41,946 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:20:41,946 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:20:41,946 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:20:41,946 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:20:41,947 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:20:41,947 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:41,947 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:20:41,947 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:20:41,947 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10_true-termination.c_Iteration3_Loop [2019-01-14 02:20:41,947 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:20:41,947 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:20:41,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:41,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:41,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:42,129 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:20:42,129 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:20:42,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:20:42,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:20:42,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:20:42,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:20:42,131 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:20:42,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:20:42,132 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:20:42,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:20:42,143 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:20:42,155 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:20:42,155 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:20:42,155 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:20:42,156 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:20:42,157 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:20:42,157 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~y~0 - 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2019-01-14 02:20:42,158 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:20:42,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:42,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:42,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:20:42,305 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:20:42,305 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 02:20:42,319 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 11 states and 13 transitions. Complement of second has 5 states. [2019-01-14 02:20:42,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:20:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:20:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:20:42,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:20:42,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:42,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:20:42,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:42,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 02:20:42,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:42,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-14 02:20:42,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:20:42,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2019-01-14 02:20:42,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:20:42,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:20:42,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-01-14 02:20:42,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:20:42,325 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-14 02:20:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-01-14 02:20:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-14 02:20:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:20:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-14 02:20:42,327 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:20:42,327 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:20:42,327 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:20:42,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-01-14 02:20:42,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:20:42,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:20:42,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:20:42,328 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-14 02:20:42,328 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:20:42,328 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~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;main_~c~0 := 0; 203#L12-2 assume !!!(main_~x~0 == main_~y~0); 204#L12 assume main_~x~0 > main_~y~0;main_~y~0 := 1 + main_~y~0; 205#L12-2 assume !!!(main_~x~0 == main_~y~0); 206#L12 [2019-01-14 02:20:42,329 INFO L796 eck$LassoCheckResult]: Loop: 206#L12 assume !(main_~x~0 > main_~y~0);main_~x~0 := 1 + main_~x~0; 208#L12-2 assume !!!(main_~x~0 == main_~y~0); 206#L12 [2019-01-14 02:20:42,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:42,329 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-14 02:20:42,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:20:42,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:20:42,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:42,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:20:42,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:42,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-14 02:20:42,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:20:42,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:20:42,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:42,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:20:42,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:20:42,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:42,347 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 2 times [2019-01-14 02:20:42,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:20:42,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:20:42,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:42,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:20:42,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:20:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:20:42,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:20:42,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:20:42,439 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:20:42,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:20:42,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:20:42,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:20:42,440 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:20:42,441 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:42,441 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:20:42,441 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:20:42,441 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10_true-termination.c_Iteration4_Loop [2019-01-14 02:20:42,441 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:20:42,442 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:20:42,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:42,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:42,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:42,646 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 15 [2019-01-14 02:20:42,654 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:20:42,655 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:42,658 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:20:42,658 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:20:42,679 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:20:42,680 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:42,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:20:42,686 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-14 02:20:42,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:20:42,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:20:44,994 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:20:44,997 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:20:44,997 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:20:44,997 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:20:44,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:20:44,998 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:20:44,998 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:20:44,998 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:20:44,998 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:20:44,998 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10_true-termination.c_Iteration4_Loop [2019-01-14 02:20:44,998 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:20:44,998 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:20:45,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:45,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:45,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:20:45,135 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:20:45,135 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:20:45,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:20:45,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:20:45,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:20:45,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:20:45,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:20:45,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:20:45,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:20:45,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:20:45,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:20:45,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:20:45,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:20:45,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:20:45,149 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:20:45,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:20:45,153 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:20:45,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:20:45,160 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:20:45,164 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:20:45,164 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:20:45,165 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:20:45,165 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:20:45,165 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:20:45,165 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~y~0 - 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2019-01-14 02:20:45,165 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:20:45,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:45,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:45,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:20:45,262 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:20:45,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 02:20:45,269 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 7 states and 8 transitions. Complement of second has 3 states. [2019-01-14 02:20:45,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-01-14 02:20:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:20:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2019-01-14 02:20:45,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:20:45,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:45,271 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:20:45,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:45,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:45,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:20:45,341 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-14 02:20:45,341 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 02:20:45,347 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 7 states and 8 transitions. Complement of second has 3 states. [2019-01-14 02:20:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-01-14 02:20:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:20:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2019-01-14 02:20:45,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:20:45,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:45,351 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:20:45,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:20:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:45,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:20:45,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:20:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:20:45,416 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-14 02:20:45,417 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 02:20:45,429 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 9 transitions. Complement of second has 4 states. [2019-01-14 02:20:45,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:20:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:20:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-14 02:20:45,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:20:45,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:45,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:20:45,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:45,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:20:45,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:20:45,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-01-14 02:20:45,439 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:20:45,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2019-01-14 02:20:45,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:20:45,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:20:45,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:20:45,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:20:45,439 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:20:45,439 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:20:45,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:20:45,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:20:45,440 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-01-14 02:20:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:20:45,440 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:20:45,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:20:45,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:20:45,441 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:20:45,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:20:45,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:20:45,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:20:45,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:20:45,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:20:45,441 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:20:45,442 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:20:45,442 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:20:45,442 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:20:45,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:20:45,442 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:20:45,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:20:45,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:20:45 BoogieIcfgContainer [2019-01-14 02:20:45,449 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:20:45,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:20:45,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:20:45,450 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:20:45,452 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:20:36" (3/4) ... [2019-01-14 02:20:45,455 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:20:45,455 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:20:45,456 INFO L168 Benchmark]: Toolchain (without parser) took 9916.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 951.4 MB in the beginning and 797.0 MB in the end (delta: 154.4 MB). Peak memory consumption was 257.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:20:45,458 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:20:45,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.68 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:20:45,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.44 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:20:45,459 INFO L168 Benchmark]: Boogie Preprocessor took 32.81 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:20:45,461 INFO L168 Benchmark]: RCFGBuilder took 389.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:20:45,462 INFO L168 Benchmark]: BuchiAutomizer took 9162.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 803.9 MB in the end (delta: 273.6 MB). Peak memory consumption was 273.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:20:45,463 INFO L168 Benchmark]: Witness Printer took 5.50 ms. Allocated memory is still 1.1 GB. Free memory is still 797.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:20:45,468 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.16 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 277.68 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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 42.44 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 32.81 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 389.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9162.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 803.9 MB in the end (delta: 273.6 MB). Peak memory consumption was 273.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.50 ms. Allocated memory is still 1.1 GB. Free memory is still 797.0 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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x + -1 * y and consists of 4 locations. One deterministic module has affine ranking function -1 * y + x and consists of 3 locations. One deterministic module has affine ranking function 2 * y + -2 * x + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * y + -2 * x + 1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 7.7s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 20 SDtfs, 18 SDslu, 3 SDs, 0 SdLazy, 43 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax200 hnf98 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq165 hnf94 smp100 dnf132 smp89 tf110 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...