./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e334e85dd18553afecc96b27cf49a003304cbca8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:14:51,447 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:14:51,450 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:14:51,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:14:51,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:14:51,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:14:51,471 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:14:51,473 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:14:51,475 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:14:51,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:14:51,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:14:51,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:14:51,479 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:14:51,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:14:51,482 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:14:51,483 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:14:51,484 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:14:51,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:14:51,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:14:51,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:14:51,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:14:51,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:14:51,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:14:51,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:14:51,498 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:14:51,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:14:51,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:14:51,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:14:51,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:14:51,503 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:14:51,504 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:14:51,504 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:14:51,505 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:14:51,505 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:14:51,506 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:14:51,507 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:14:51,507 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:14:51,538 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:14:51,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:14:51,540 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:14:51,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:14:51,540 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:14:51,541 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:14:51,541 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:14:51,542 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:14:51,542 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:14:51,542 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:14:51,542 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:14:51,542 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:14:51,543 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:14:51,543 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:14:51,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:14:51,543 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:14:51,543 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:14:51,543 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:14:51,544 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:14:51,544 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:14:51,544 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:14:51,544 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:14:51,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:14:51,545 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:14:51,546 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:14:51,546 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:14:51,546 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:14:51,546 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:14:51,547 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:14:51,548 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 -> e334e85dd18553afecc96b27cf49a003304cbca8 [2018-11-28 23:14:51,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:14:51,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:14:51,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:14:51,629 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:14:51,630 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:14:51,631 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c [2018-11-28 23:14:51,706 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b1140fa/2de0744786dd44ec812093026647e2dc/FLAG770e92781 [2018-11-28 23:14:52,234 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:14:52,234 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c [2018-11-28 23:14:52,241 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b1140fa/2de0744786dd44ec812093026647e2dc/FLAG770e92781 [2018-11-28 23:14:52,588 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b1140fa/2de0744786dd44ec812093026647e2dc [2018-11-28 23:14:52,592 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:14:52,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:14:52,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:14:52,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:14:52,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:14:52,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:52" (1/1) ... [2018-11-28 23:14:52,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4a907d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52, skipping insertion in model container [2018-11-28 23:14:52,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:52" (1/1) ... [2018-11-28 23:14:52,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:14:52,631 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:14:52,792 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:14:52,797 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:14:52,817 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:14:52,835 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:14:52,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52 WrapperNode [2018-11-28 23:14:52,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:14:52,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:14:52,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:14:52,837 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:14:52,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52" (1/1) ... [2018-11-28 23:14:52,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52" (1/1) ... [2018-11-28 23:14:52,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:14:52,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:14:52,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:14:52,885 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:14:52,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52" (1/1) ... [2018-11-28 23:14:52,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52" (1/1) ... [2018-11-28 23:14:52,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52" (1/1) ... [2018-11-28 23:14:52,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52" (1/1) ... [2018-11-28 23:14:52,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52" (1/1) ... [2018-11-28 23:14:52,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52" (1/1) ... [2018-11-28 23:14:52,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52" (1/1) ... [2018-11-28 23:14:52,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:14:52,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:14:52,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:14:52,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:14:52,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52" (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 [2018-11-28 23:14:53,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:14:53,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:14:53,336 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:14:53,336 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:14:53,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:53 BoogieIcfgContainer [2018-11-28 23:14:53,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:14:53,338 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:14:53,338 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:14:53,342 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:14:53,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:53,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:14:52" (1/3) ... [2018-11-28 23:14:53,349 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@794390e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:14:53, skipping insertion in model container [2018-11-28 23:14:53,349 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:53,349 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:52" (2/3) ... [2018-11-28 23:14:53,351 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@794390e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:14:53, skipping insertion in model container [2018-11-28 23:14:53,351 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:53,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:53" (3/3) ... [2018-11-28 23:14:53,354 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c [2018-11-28 23:14:53,437 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:14:53,438 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:14:53,438 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:14:53,439 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:14:53,439 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:14:53,439 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:14:53,439 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:14:53,439 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:14:53,439 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:14:53,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-11-28 23:14:53,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:14:53,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:53,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:53,490 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:14:53,490 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:14:53,490 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:14:53,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-11-28 23:14:53,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:14:53,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:53,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:53,493 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:14:53,493 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:14:53,503 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~m~0, main_~n~0, main_~v1~0, main_~v2~0;havoc main_~m~0;havoc main_~n~0;havoc main_~v1~0;havoc main_~v2~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L17true assume main_~n~0 >= 0 && main_~m~0 > 0;main_~v1~0 := main_~n~0;main_~v2~0 := 0; 9#L21-2true [2018-11-28 23:14:53,503 INFO L796 eck$LassoCheckResult]: Loop: 9#L21-2true assume !!(main_~v1~0 > 0); 3#L21true assume main_~v2~0 < main_~m~0;main_~v2~0 := 1 + main_~v2~0;main_~v1~0 := main_~v1~0 - 1; 9#L21-2true [2018-11-28 23:14:53,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,511 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2018-11-28 23:14:53,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:53,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:53,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:53,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 1 times [2018-11-28 23:14:53,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:53,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:53,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:53,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,646 INFO L82 PathProgramCache]: Analyzing trace with hash 957575, now seen corresponding path program 1 times [2018-11-28 23:14:53,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:53,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,860 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:14:53,884 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:53,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:53,885 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:53,885 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:53,885 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:53,886 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:53,886 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:53,886 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:53,886 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 23:14:53,886 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:53,887 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:53,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,264 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:54,266 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) [2018-11-28 23:14:54,278 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:54,278 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:54,336 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:54,336 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:14:54,347 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:54,348 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:54,378 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:54,378 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 [2018-11-28 23:14:54,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:54,385 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 [2018-11-28 23:14:54,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:54,411 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:54,535 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:54,538 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:54,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:54,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:54,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:54,538 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:54,538 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:54,539 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:54,539 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:54,539 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 23:14:54,539 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:54,539 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:54,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,868 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:54,875 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:54,877 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 [2018-11-28 23:14:54,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:54,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:54,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:54,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:54,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:54,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:54,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:54,894 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 [2018-11-28 23:14:54,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:54,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:54,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:54,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:54,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:54,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:54,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:54,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:54,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:54,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:54,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:54,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:54,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:54,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:54,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:54,940 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:54,951 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:14:54,952 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:54,955 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:54,955 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:54,955 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:54,956 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v2~0, ULTIMATE.start_main_~m~0) = -1*ULTIMATE.start_main_~v2~0 + 1*ULTIMATE.start_main_~m~0 Supporting invariants [] [2018-11-28 23:14:54,959 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:55,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:55,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:55,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:55,094 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 [2018-11-28 23:14:55,096 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2018-11-28 23:14:55,149 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 6 states. [2018-11-28 23:14:55,150 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 [2018-11-28 23:14:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:14:55,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-28 23:14:55,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:55,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:14:55,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:55,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:14:55,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:55,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2018-11-28 23:14:55,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:14:55,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2018-11-28 23:14:55,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 23:14:55,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:14:55,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2018-11-28 23:14:55,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:55,172 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-11-28 23:14:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2018-11-28 23:14:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-11-28 23:14:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:14:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-11-28 23:14:55,208 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-11-28 23:14:55,209 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-11-28 23:14:55,209 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:14:55,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2018-11-28 23:14:55,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:14:55,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:55,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:55,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:14:55,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:14:55,213 INFO L794 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~m~0, main_~n~0, main_~v1~0, main_~v2~0;havoc main_~m~0;havoc main_~n~0;havoc main_~v1~0;havoc main_~v2~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 77#L17 assume main_~n~0 >= 0 && main_~m~0 > 0;main_~v1~0 := main_~n~0;main_~v2~0 := 0; 78#L21-2 assume !!(main_~v1~0 > 0); 72#L21 assume !(main_~v2~0 < main_~m~0);main_~v2~0 := 0; 73#L21-2 [2018-11-28 23:14:55,213 INFO L796 eck$LassoCheckResult]: Loop: 73#L21-2 assume !!(main_~v1~0 > 0); 79#L21 assume main_~v2~0 < main_~m~0;main_~v2~0 := 1 + main_~v2~0;main_~v1~0 := main_~v1~0 - 1; 73#L21-2 [2018-11-28 23:14:55,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:55,214 INFO L82 PathProgramCache]: Analyzing trace with hash 957577, now seen corresponding path program 1 times [2018-11-28 23:14:55,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:55,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:55,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:55,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:55,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:55,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:14:55,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:14:55,311 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:14:55,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 2 times [2018-11-28 23:14:55,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:55,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:55,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:55,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:55,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:55,362 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:55,362 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:55,362 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:55,363 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:55,363 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:55,363 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:55,363 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:55,363 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:55,363 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:14:55,364 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:55,364 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:55,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,509 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:55,510 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:14:55,522 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:55,523 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:55,546 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:55,546 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:55,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:55,551 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:55,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:55,594 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:55,743 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:55,746 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:55,747 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:55,747 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:55,747 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:55,747 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:55,747 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:55,747 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:55,749 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:55,749 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:14:55,750 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:55,750 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:55,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:56,115 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 23:14:56,229 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 23:14:56,433 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:56,434 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:56,434 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 [2018-11-28 23:14:56,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:56,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:56,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:56,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:56,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:56,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:56,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:56,443 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 [2018-11-28 23:14:56,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:56,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:56,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:56,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:56,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:56,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:56,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:56,451 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:56,457 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:14:56,458 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:56,458 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:56,458 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:56,458 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:56,459 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~v2~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~v2~0 Supporting invariants [] [2018-11-28 23:14:56,459 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:56,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:56,534 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 [2018-11-28 23:14:56,535 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:14:56,576 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 12 states and 17 transitions. Complement of second has 5 states. [2018-11-28 23:14:56,578 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 [2018-11-28 23:14:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:14:56,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:14:56,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:56,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 23:14:56,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:56,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 23:14:56,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:56,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2018-11-28 23:14:56,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:14:56,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2018-11-28 23:14:56,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:14:56,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:14:56,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2018-11-28 23:14:56,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:56,584 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-28 23:14:56,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2018-11-28 23:14:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-28 23:14:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:14:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-11-28 23:14:56,586 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-28 23:14:56,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:14:56,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:14:56,590 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 3 states. [2018-11-28 23:14:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:56,607 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2018-11-28 23:14:56,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:14:56,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2018-11-28 23:14:56,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:14:56,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 17 transitions. [2018-11-28 23:14:56,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:14:56,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:14:56,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-28 23:14:56,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:56,613 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 23:14:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-28 23:14:56,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-28 23:14:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:14:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-11-28 23:14:56,615 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:14:56,615 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:14:56,615 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:14:56,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-11-28 23:14:56,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:14:56,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:56,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:56,617 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2018-11-28 23:14:56,617 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:14:56,617 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~m~0, main_~n~0, main_~v1~0, main_~v2~0;havoc main_~m~0;havoc main_~n~0;havoc main_~v1~0;havoc main_~v2~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 160#L17 assume main_~n~0 >= 0 && main_~m~0 > 0;main_~v1~0 := main_~n~0;main_~v2~0 := 0; 161#L21-2 assume !!(main_~v1~0 > 0); 157#L21 assume main_~v2~0 < main_~m~0;main_~v2~0 := 1 + main_~v2~0;main_~v1~0 := main_~v1~0 - 1; 158#L21-2 assume !!(main_~v1~0 > 0); 155#L21 assume !(main_~v2~0 < main_~m~0);main_~v2~0 := 0; 156#L21-2 assume !!(main_~v1~0 > 0); 164#L21 assume !(main_~v2~0 < main_~m~0);main_~v2~0 := 0; 162#L21-2 [2018-11-28 23:14:56,618 INFO L796 eck$LassoCheckResult]: Loop: 162#L21-2 assume !!(main_~v1~0 > 0); 163#L21 assume main_~v2~0 < main_~m~0;main_~v2~0 := 1 + main_~v2~0;main_~v1~0 := main_~v1~0 - 1; 162#L21-2 [2018-11-28 23:14:56,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:56,618 INFO L82 PathProgramCache]: Analyzing trace with hash -422236399, now seen corresponding path program 1 times [2018-11-28 23:14:56,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:56,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:56,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:56,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:56,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:14:56,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:14:56,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:14:56,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:14:56,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:14:56,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-28 23:14:56,731 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:14:56,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:56,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 3 times [2018-11-28 23:14:56,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:56,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:56,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:56,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:56,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:56,774 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:56,774 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:56,774 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:56,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:56,774 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:56,775 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:56,775 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:56,775 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:56,775 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 23:14:56,775 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:56,775 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:56,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:56,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:56,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:56,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:56,921 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:56,922 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 [2018-11-28 23:14:56,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:56,933 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:56,955 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:56,955 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:56,962 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:56,962 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:56,988 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:56,988 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:57,120 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:57,122 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:57,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:57,122 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:57,122 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:57,123 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:57,123 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:57,123 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:57,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:57,123 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 23:14:57,124 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:57,127 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:57,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,296 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:57,296 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:57,296 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 [2018-11-28 23:14:57,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:57,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:57,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:57,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:57,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:57,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:57,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:57,307 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 [2018-11-28 23:14:57,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:57,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:57,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:57,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:57,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:57,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:57,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:57,313 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:57,319 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:14:57,319 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:57,320 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:57,320 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:57,320 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:57,320 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v2~0, ULTIMATE.start_main_~m~0) = -1*ULTIMATE.start_main_~v2~0 + 1*ULTIMATE.start_main_~m~0 Supporting invariants [] [2018-11-28 23:14:57,321 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:57,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:57,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:57,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:57,425 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 [2018-11-28 23:14:57,425 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:14:57,453 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 14 states and 20 transitions. Complement of second has 5 states. [2018-11-28 23:14:57,453 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 [2018-11-28 23:14:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:14:57,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:14:57,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:57,455 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:57,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:57,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:57,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:57,519 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:14:57,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:14:57,534 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 14 states and 20 transitions. Complement of second has 5 states. [2018-11-28 23:14:57,538 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 [2018-11-28 23:14:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:14:57,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:14:57,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:57,539 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:57,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:57,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:57,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:57,644 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:14:57,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:14:57,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 16 states and 23 transitions. Complement of second has 4 states. [2018-11-28 23:14:57,665 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 [2018-11-28 23:14:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 23:14:57,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:14:57,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:57,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 23:14:57,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:57,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 23:14:57,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:57,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2018-11-28 23:14:57,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:14:57,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. [2018-11-28 23:14:57,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:14:57,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:14:57,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-28 23:14:57,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:57,671 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:14:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-28 23:14:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 7. [2018-11-28 23:14:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:14:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-28 23:14:57,673 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 23:14:57,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:14:57,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:14:57,674 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 5 states. [2018-11-28 23:14:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:57,722 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-11-28 23:14:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:14:57,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-28 23:14:57,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:57,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 8 states and 9 transitions. [2018-11-28 23:14:57,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 23:14:57,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-28 23:14:57,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2018-11-28 23:14:57,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:57,725 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-11-28 23:14:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2018-11-28 23:14:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2018-11-28 23:14:57,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:14:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-28 23:14:57,727 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-28 23:14:57,727 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-28 23:14:57,728 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:14:57,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2018-11-28 23:14:57,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:14:57,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:57,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:57,730 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:14:57,730 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-28 23:14:57,730 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~m~0, main_~n~0, main_~v1~0, main_~v2~0;havoc main_~m~0;havoc main_~n~0;havoc main_~v1~0;havoc main_~v2~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 373#L17 assume main_~n~0 >= 0 && main_~m~0 > 0;main_~v1~0 := main_~n~0;main_~v2~0 := 0; 369#L21-2 [2018-11-28 23:14:57,730 INFO L796 eck$LassoCheckResult]: Loop: 369#L21-2 assume !!(main_~v1~0 > 0); 370#L21 assume main_~v2~0 < main_~m~0;main_~v2~0 := 1 + main_~v2~0;main_~v1~0 := main_~v1~0 - 1; 371#L21-2 assume !!(main_~v1~0 > 0); 368#L21 assume !(main_~v2~0 < main_~m~0);main_~v2~0 := 0; 369#L21-2 [2018-11-28 23:14:57,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,730 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 2 times [2018-11-28 23:14:57,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:57,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:57,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:57,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1326601, now seen corresponding path program 1 times [2018-11-28 23:14:57,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:57,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:57,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:57,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash 920229996, now seen corresponding path program 2 times [2018-11-28 23:14:57,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:57,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:57,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:57,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,871 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:57,871 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:57,871 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:57,872 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:57,872 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:57,872 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:57,872 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:57,872 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:57,872 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:14:57,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:57,873 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:57,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,964 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:57,965 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:57,972 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:57,972 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:57,976 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:57,976 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~v2~0=0, ULTIMATE.start_main_~m~0=1} Honda state: {ULTIMATE.start_main_~v2~0=0, ULTIMATE.start_main_~m~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:57,997 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:57,997 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:58,018 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:58,019 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:58,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:58,024 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:58,049 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:58,049 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:58,109 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:58,110 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:58,111 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:58,111 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:58,111 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:58,111 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:58,111 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:58,111 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:58,111 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:58,112 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:14:58,112 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:58,112 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:58,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:58,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:58,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:58,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:58,213 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:58,213 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:58,214 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 [2018-11-28 23:14:58,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:58,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:58,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:58,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:58,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:58,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:58,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:58,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:58,224 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 [2018-11-28 23:14:58,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:58,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:58,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:58,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:58,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:58,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:58,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:58,229 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:58,233 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:58,233 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:58,233 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:58,234 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:58,234 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:58,234 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v1~0) = 1*ULTIMATE.start_main_~v1~0 Supporting invariants [] [2018-11-28 23:14:58,234 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:58,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:58,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:58,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:58,332 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:14:58,332 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-28 23:14:58,355 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 13 states and 15 transitions. Complement of second has 6 states. [2018-11-28 23:14:58,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:14:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-28 23:14:58,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:14:58,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:58,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:14:58,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:58,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 23:14:58,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:58,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-11-28 23:14:58,360 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:14:58,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2018-11-28 23:14:58,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:14:58,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:14:58,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:14:58,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:14:58,361 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:58,361 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:58,361 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:58,361 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:14:58,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:14:58,362 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:14:58,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:14:58,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:14:58 BoogieIcfgContainer [2018-11-28 23:14:58,370 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:14:58,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:14:58,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:14:58,371 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:14:58,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:53" (3/4) ... [2018-11-28 23:14:58,375 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:14:58,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:14:58,376 INFO L168 Benchmark]: Toolchain (without parser) took 5784.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 951.4 MB in the beginning and 823.7 MB in the end (delta: 127.7 MB). Peak memory consumption was 247.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:58,378 INFO L168 Benchmark]: CDTParser took 0.20 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. [2018-11-28 23:14:58,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.64 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:58,379 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.33 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:58,379 INFO L168 Benchmark]: Boogie Preprocessor took 26.38 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:58,380 INFO L168 Benchmark]: RCFGBuilder took 425.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:58,381 INFO L168 Benchmark]: BuchiAutomizer took 5032.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 823.7 MB in the end (delta: 279.8 MB). Peak memory consumption was 279.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:58,382 INFO L168 Benchmark]: Witness Printer took 4.74 ms. Allocated memory is still 1.1 GB. Free memory is still 823.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:58,386 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.20 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 241.64 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.33 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.38 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 425.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5032.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 823.7 MB in the end (delta: 279.8 MB). Peak memory consumption was 279.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.74 ms. Allocated memory is still 1.1 GB. Free memory is still 823.7 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 -1 * v2 + m and consists of 4 locations. One deterministic module has affine ranking function m + -1 * v2 and consists of 3 locations. One deterministic module has affine ranking function v1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * v2 + m and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 3.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 45 SDtfs, 35 SDslu, 12 SDs, 0 SdLazy, 34 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax164 hnf100 lsp34 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...