./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi4_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 f560e32afd5a40adf4a98abbf810cb377947c4f4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:16:08,411 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:16:08,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:16:08,425 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:16:08,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:16:08,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:16:08,427 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:16:08,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:16:08,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:16:08,436 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:16:08,443 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:16:08,443 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:16:08,445 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:16:08,446 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:16:08,447 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:16:08,448 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:16:08,449 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:16:08,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:16:08,453 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:16:08,455 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:16:08,456 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:16:08,458 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:16:08,461 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:16:08,461 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:16:08,461 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:16:08,462 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:16:08,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:16:08,468 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:16:08,470 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:16:08,472 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:16:08,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:16:08,473 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:16:08,473 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:16:08,474 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:16:08,476 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:16:08,477 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:16:08,478 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:16:08,497 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:16:08,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:16:08,500 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:16:08,501 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:16:08,501 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:16:08,502 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:16:08,502 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:16:08,502 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:16:08,502 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:16:08,502 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:16:08,502 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:16:08,503 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:16:08,503 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:16:08,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:16:08,503 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:16:08,503 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:16:08,503 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:16:08,506 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:16:08,506 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:16:08,507 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:16:08,507 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:16:08,507 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:16:08,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:16:08,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:16:08,508 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:16:08,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:16:08,509 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:16:08,509 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:16:08,511 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:16:08,511 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 -> f560e32afd5a40adf4a98abbf810cb377947c4f4 [2019-01-14 02:16:08,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:16:08,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:16:08,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:16:08,575 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:16:08,577 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:16:08,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c [2019-01-14 02:16:08,648 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c5ccf44/a97c5a364bba45c289dc34ffc0def8b1/FLAG76135ae18 [2019-01-14 02:16:09,072 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:16:09,073 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c [2019-01-14 02:16:09,082 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c5ccf44/a97c5a364bba45c289dc34ffc0def8b1/FLAG76135ae18 [2019-01-14 02:16:09,478 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c5ccf44/a97c5a364bba45c289dc34ffc0def8b1 [2019-01-14 02:16:09,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:16:09,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:16:09,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:16:09,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:16:09,490 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:16:09,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:16:09" (1/1) ... [2019-01-14 02:16:09,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672937de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09, skipping insertion in model container [2019-01-14 02:16:09,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:16:09" (1/1) ... [2019-01-14 02:16:09,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:16:09,529 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:16:09,782 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:16:09,787 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:16:09,809 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:16:09,827 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:16:09,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09 WrapperNode [2019-01-14 02:16:09,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:16:09,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:16:09,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:16:09,829 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:16:09,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09" (1/1) ... [2019-01-14 02:16:09,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09" (1/1) ... [2019-01-14 02:16:09,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:16:09,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:16:09,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:16:09,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:16:09,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09" (1/1) ... [2019-01-14 02:16:09,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09" (1/1) ... [2019-01-14 02:16:09,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09" (1/1) ... [2019-01-14 02:16:09,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09" (1/1) ... [2019-01-14 02:16:09,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09" (1/1) ... [2019-01-14 02:16:09,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09" (1/1) ... [2019-01-14 02:16:09,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09" (1/1) ... [2019-01-14 02:16:09,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:16:09,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:16:09,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:16:09,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:16:09,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:16:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:16:10,174 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:16:10,175 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:16:10,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:10 BoogieIcfgContainer [2019-01-14 02:16:10,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:16:10,176 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:16:10,176 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:16:10,180 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:16:10,180 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:10,181 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:16:09" (1/3) ... [2019-01-14 02:16:10,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36db3f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:16:10, skipping insertion in model container [2019-01-14 02:16:10,182 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:10,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:09" (2/3) ... [2019-01-14 02:16:10,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36db3f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:16:10, skipping insertion in model container [2019-01-14 02:16:10,183 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:10,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:10" (3/3) ... [2019-01-14 02:16:10,185 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c [2019-01-14 02:16:10,245 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:16:10,246 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:16:10,246 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:16:10,246 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:16:10,246 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:16:10,247 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:16:10,247 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:16:10,247 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:16:10,247 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:16:10,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:16:10,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:10,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:10,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:10,330 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:16:10,331 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:16:10,331 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:16:10,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:16:10,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:10,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:10,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:10,336 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:16:10,336 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:16:10,351 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~m~0;havoc main_~n~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_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := main_~n~0; 8#L20-2true [2019-01-14 02:16:10,351 INFO L796 eck$LassoCheckResult]: Loop: 8#L20-2true assume !!(main_~i~0 > 0); 10#L20true assume main_~i~0 < main_~m~0;main_~i~0 := main_~i~0 - 1; 8#L20-2true [2019-01-14 02:16:10,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:10,366 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-01-14 02:16:10,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:10,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:10,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:10,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:10,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 1 times [2019-01-14 02:16:10,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:10,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:10,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:10,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:10,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:10,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:10,513 INFO L82 PathProgramCache]: Analyzing trace with hash 957575, now seen corresponding path program 1 times [2019-01-14 02:16:10,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:10,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:10,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:10,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:16:10,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:16:10,674 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:10,675 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:10,675 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:10,675 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:10,675 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:10,676 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:10,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:10,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:10,676 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:16:10,676 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:10,677 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:10,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:10,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:10,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:10,871 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:10,873 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:16:10,886 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:10,886 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:10,925 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:10,926 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:10,932 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:10,932 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:10,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:10,954 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:10,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:10,962 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:10,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:10,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:11,020 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:11,022 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:11,022 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:11,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:11,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:11,022 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:11,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:11,023 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:11,023 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:11,023 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:16:11,023 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:11,023 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:11,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:11,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:11,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:11,426 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:11,431 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:11,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:11,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:11,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:11,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:11,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:11,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:11,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:11,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:11,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:11,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:11,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:11,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:11,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:11,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:11,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:11,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:11,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:11,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:11,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:11,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:11,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:11,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:11,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:11,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:11,473 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:11,477 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:11,478 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:11,480 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:11,480 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:11,481 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:11,481 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:16:11,482 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:11,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:11,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:11,640 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:11,642 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-01-14 02:16:11,754 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 8 states. [2019-01-14 02:16:11,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-01-14 02:16:11,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:16:11,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:11,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:16:11,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:11,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 02:16:11,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:11,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-01-14 02:16:11,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:11,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2019-01-14 02:16:11,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:16:11,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:16:11,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2019-01-14 02:16:11,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:11,775 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-14 02:16:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2019-01-14 02:16:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-14 02:16:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:16:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-14 02:16:11,804 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-14 02:16:11,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:16:11,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:16:11,807 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 3 states. [2019-01-14 02:16:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:16:11,854 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-14 02:16:11,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:16:11,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2019-01-14 02:16:11,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:11,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2019-01-14 02:16:11,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:16:11,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:16:11,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2019-01-14 02:16:11,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:16:11,859 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:16:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2019-01-14 02:16:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-14 02:16:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:16:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-14 02:16:11,862 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:16:11,862 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:16:11,862 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:16:11,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-01-14 02:16:11,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:11,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:11,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:11,864 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:16:11,864 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:16:11,865 INFO L794 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 93#L17 assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := main_~n~0; 94#L20-2 assume !!(main_~i~0 > 0); 97#L20 assume !(main_~i~0 < main_~m~0);main_~i~0 := main_~i~0 - main_~m~0; 95#L20-2 [2019-01-14 02:16:11,865 INFO L796 eck$LassoCheckResult]: Loop: 95#L20-2 assume !!(main_~i~0 > 0); 96#L20 assume main_~i~0 < main_~m~0;main_~i~0 := main_~i~0 - 1; 95#L20-2 [2019-01-14 02:16:11,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:11,865 INFO L82 PathProgramCache]: Analyzing trace with hash 957577, now seen corresponding path program 1 times [2019-01-14 02:16:11,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:11,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:11,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:11,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:11,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 2 times [2019-01-14 02:16:11,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:11,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:11,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:11,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:11,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:11,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:11,918 INFO L82 PathProgramCache]: Analyzing trace with hash 920231916, now seen corresponding path program 1 times [2019-01-14 02:16:11,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:11,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:11,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:11,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:11,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:11,980 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:11,980 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:11,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:11,980 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:11,980 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:11,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:11,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:11,981 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:11,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:16:11,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:11,981 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:11,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:11,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,119 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:12,119 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:12,124 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:12,124 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:12,145 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:12,145 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:12,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:12,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:12,173 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:12,173 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:12,178 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:12,178 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:12,204 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:12,205 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:12,230 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:12,232 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:12,232 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:12,232 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:12,232 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:12,233 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:12,233 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:12,233 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:12,233 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:12,233 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:16:12,233 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:12,233 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:12,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:12,463 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 02:16:12,464 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:12,465 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:12,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:12,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:12,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:12,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:12,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:12,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:12,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:12,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:12,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:12,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:12,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:12,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:12,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:12,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:12,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:12,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:12,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:12,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:12,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:12,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:12,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:12,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:12,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:12,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:12,490 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:12,495 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:12,495 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:12,496 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:12,496 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:12,496 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:12,496 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:16:12,497 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:12,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:12,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:12,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:12,840 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:12,841 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-01-14 02:16:12,857 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 10 states and 13 transitions. Complement of second has 5 states. [2019-01-14 02:16:12,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:16:12,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:16:12,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:12,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:16:12,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:12,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:16:12,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:12,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-01-14 02:16:12,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:12,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:16:12,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:16:12,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:16:12,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-14 02:16:12,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:12,863 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:16:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-14 02:16:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 02:16:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:16:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:16:12,865 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:16:12,865 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:16:12,865 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:16:12,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 02:16:12,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:12,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:12,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:12,867 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2019-01-14 02:16:12,867 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:16:12,867 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L17 assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := main_~n~0; 149#L20-2 assume !!(main_~i~0 > 0); 156#L20 assume !(main_~i~0 < main_~m~0);main_~i~0 := main_~i~0 - main_~m~0; 155#L20-2 assume !!(main_~i~0 > 0); 154#L20 assume !(main_~i~0 < main_~m~0);main_~i~0 := main_~i~0 - main_~m~0; 150#L20-2 [2019-01-14 02:16:12,867 INFO L796 eck$LassoCheckResult]: Loop: 150#L20-2 assume !!(main_~i~0 > 0); 151#L20 assume main_~i~0 < main_~m~0;main_~i~0 := main_~i~0 - 1; 150#L20-2 [2019-01-14 02:16:12,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash 920231918, now seen corresponding path program 2 times [2019-01-14 02:16:12,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:12,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:12,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:12,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 3 times [2019-01-14 02:16:12,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:12,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:12,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:12,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:12,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:12,898 INFO L82 PathProgramCache]: Analyzing trace with hash -420389359, now seen corresponding path program 2 times [2019-01-14 02:16:12,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:12,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:12,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:12,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:12,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:12,949 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:12,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:12,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:12,950 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:12,950 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:12,950 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:12,950 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:12,950 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:12,950 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:16:12,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:12,951 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:12,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,095 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:13,096 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:13,100 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:13,101 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:13,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:13,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:13,153 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:13,155 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:13,155 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:13,155 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:13,156 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:13,156 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:13,156 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:13,156 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:13,156 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:13,156 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:16:13,156 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:13,156 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:13,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,245 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:13,246 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:13,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:13,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:13,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:13,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:13,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:13,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:13,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:13,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:13,255 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:13,257 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:13,258 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:13,258 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:13,258 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:13,258 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:13,258 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:16:13,259 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:13,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:13,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:13,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:13,329 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:13,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:16:13,357 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 12 states and 17 transitions. Complement of second has 5 states. [2019-01-14 02:16:13,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:16:13,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:16:13,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:13,360 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:13,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:13,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:13,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:13,419 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:13,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:16:13,431 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 12 states and 17 transitions. Complement of second has 5 states. [2019-01-14 02:16:13,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:16:13,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:16:13,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:13,435 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:13,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:13,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:13,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:13,529 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:13,529 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:16:13,561 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 14 states and 20 transitions. Complement of second has 4 states. [2019-01-14 02:16:13,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-14 02:16:13,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:16:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:13,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:16:13,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:13,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:16:13,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:13,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 20 transitions. [2019-01-14 02:16:13,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:16:13,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 16 transitions. [2019-01-14 02:16:13,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:16:13,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:16:13,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-14 02:16:13,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:13,572 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:16:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-14 02:16:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-01-14 02:16:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:16:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-14 02:16:13,574 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:16:13,574 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:16:13,574 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:16:13,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-14 02:16:13,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:16:13,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:13,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:13,575 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:16:13,575 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:16:13,575 INFO L794 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 300#L17 assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := main_~n~0; 301#L20-2 assume !!(main_~i~0 > 0); 302#L20 [2019-01-14 02:16:13,575 INFO L796 eck$LassoCheckResult]: Loop: 302#L20 assume !(main_~i~0 < main_~m~0);main_~i~0 := main_~i~0 - main_~m~0; 305#L20-2 assume !!(main_~i~0 > 0); 302#L20 [2019-01-14 02:16:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:13,577 INFO L82 PathProgramCache]: Analyzing trace with hash 30889, now seen corresponding path program 1 times [2019-01-14 02:16:13,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:13,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:13,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:13,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:13,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:13,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1532, now seen corresponding path program 1 times [2019-01-14 02:16:13,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:13,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:13,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:13,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:13,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:13,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash 29684900, now seen corresponding path program 3 times [2019-01-14 02:16:13,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:13,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:13,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:13,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:13,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:13,720 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:13,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:13,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:13,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:13,720 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:13,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:13,721 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:13,721 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:13,721 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-14 02:16:13,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:13,721 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:13,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:13,913 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:13,914 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:13,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:13,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:13,922 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:13,922 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:13,946 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:13,946 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:13,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:13,989 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:14,198 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:14,200 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:14,200 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:14,200 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:14,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:14,200 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:14,201 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:14,201 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:14,201 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:14,201 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-14 02:16:14,201 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:14,201 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:14,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:14,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:14,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:14,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:14,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:14,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:14,309 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:14,310 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:14,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:14,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:14,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:14,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:14,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:14,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:14,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:14,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:14,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:14,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:14,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:14,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:14,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:14,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:14,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:14,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:14,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:14,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:14,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:14,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:14,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:14,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:14,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:14,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:14,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:14,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:14,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:14,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:14,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:14,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:14,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:14,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:14,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:14,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:14,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:14,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:14,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:14,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:14,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:14,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:14,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:14,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:14,356 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:14,377 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:16:14,377 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:16:14,378 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:14,379 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:16:14,380 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:14,380 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~m~0) = 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~m~0 Supporting invariants [1*ULTIMATE.start_main_~m~0 - 1 >= 0] [2019-01-14 02:16:14,396 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:16:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:14,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:14,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:14,694 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:16:14,694 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:16:14,731 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2019-01-14 02:16:14,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:16:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-14 02:16:14,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:16:14,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:14,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:16:14,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:14,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-14 02:16:14,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:14,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-01-14 02:16:14,736 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:16:14,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2019-01-14 02:16:14,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:16:14,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:16:14,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:16:14,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:16:14,736 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:14,736 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:14,737 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:14,737 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:16:14,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:16:14,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:16:14,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:16:14,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:16:14 BoogieIcfgContainer [2019-01-14 02:16:14,746 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:16:14,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:16:14,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:16:14,747 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:16:14,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:10" (3/4) ... [2019-01-14 02:16:14,751 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:16:14,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:16:14,752 INFO L168 Benchmark]: Toolchain (without parser) took 5269.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.6 MB in the beginning and 851.5 MB in the end (delta: 93.1 MB). Peak memory consumption was 234.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:14,753 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:14,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.38 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:14,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.02 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:14,755 INFO L168 Benchmark]: Boogie Preprocessor took 20.31 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:14,756 INFO L168 Benchmark]: RCFGBuilder took 286.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:14,757 INFO L168 Benchmark]: BuchiAutomizer took 4570.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 851.5 MB in the end (delta: 266.2 MB). Peak memory consumption was 266.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:14,757 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 1.2 GB. Free memory is still 851.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:14,761 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.38 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 932.6 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 40.02 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.31 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 286.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4570.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 851.5 MB in the end (delta: 266.2 MB). Peak memory consumption was 266.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.57 ms. Allocated memory is still 1.2 GB. Free memory is still 851.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function i and consists of 5 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function i + -1 * m and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 32 SDtfs, 29 SDslu, 6 SDs, 0 SdLazy, 47 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax183 hnf98 lsp54 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf94 smp100 dnf100 smp100 tf108 neg100 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...