./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/c.08_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-restricted-15/c.08_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 8d821d1d8ee2aa872e0bf75fb913cf046d5ff3f8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21:40,239 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:21:40,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:21:40,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:21:40,255 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:21:40,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:21:40,258 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:21:40,260 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:21:40,262 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:21:40,263 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:21:40,264 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:21:40,264 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:21:40,265 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:21:40,266 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:21:40,267 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:21:40,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:21:40,269 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:21:40,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:21:40,273 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:21:40,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:21:40,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:21:40,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:21:40,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:21:40,282 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:21:40,282 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:21:40,283 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:21:40,284 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:21:40,285 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:21:40,286 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:21:40,287 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:21:40,287 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:21:40,288 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:21:40,288 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:21:40,288 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:21:40,290 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:21:40,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:21:40,291 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:21:40,318 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:21:40,318 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:21:40,320 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:21:40,320 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:21:40,320 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:21:40,320 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:21:40,320 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:21:40,321 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:21:40,323 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:21:40,323 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:21:40,323 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:21:40,323 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:21:40,324 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:21:40,324 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:21:40,324 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:21:40,324 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:21:40,324 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:21:40,325 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:21:40,325 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:21:40,325 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:21:40,325 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:21:40,325 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:21:40,325 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:21:40,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:21:40,327 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:21:40,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:21:40,329 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:21:40,330 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:21:40,334 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:21:40,335 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 -> 8d821d1d8ee2aa872e0bf75fb913cf046d5ff3f8 [2019-01-14 02:21:40,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:21:40,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:21:40,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:21:40,401 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:21:40,401 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:21:40,402 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/c.08_true-termination_true-no-overflow.c [2019-01-14 02:21:40,469 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10c6fbae/edafb405bd6940fa99743112b0d05faf/FLAG5aad595c4 [2019-01-14 02:21:40,904 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:21:40,905 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/c.08_true-termination_true-no-overflow.c [2019-01-14 02:21:40,913 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10c6fbae/edafb405bd6940fa99743112b0d05faf/FLAG5aad595c4 [2019-01-14 02:21:41,274 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10c6fbae/edafb405bd6940fa99743112b0d05faf [2019-01-14 02:21:41,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:21:41,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:21:41,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:21:41,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:21:41,288 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:21:41,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:21:41" (1/1) ... [2019-01-14 02:21:41,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b6b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:41, skipping insertion in model container [2019-01-14 02:21:41,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:21:41" (1/1) ... [2019-01-14 02:21:41,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:21:41,320 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:21:41,509 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:21:41,516 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:21:41,537 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:21:41,555 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:21:41,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:41 WrapperNode [2019-01-14 02:21:41,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:21:41,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:21:41,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:21:41,557 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:21:41,569 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:21:41" (1/1) ... [2019-01-14 02:21:41,577 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:21:41" (1/1) ... [2019-01-14 02:21:41,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:21:41,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:21:41,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:21:41,612 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:21:41,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:41" (1/1) ... [2019-01-14 02:21:41,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:41" (1/1) ... [2019-01-14 02:21:41,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:41" (1/1) ... [2019-01-14 02:21:41,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:41" (1/1) ... [2019-01-14 02:21:41,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:41" (1/1) ... [2019-01-14 02:21:41,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:41" (1/1) ... [2019-01-14 02:21:41,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:41" (1/1) ... [2019-01-14 02:21:41,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:21:41,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:21:41,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:21:41,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:21:41,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:41" (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:21:41,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:21:41,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:21:42,012 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:21:42,012 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:21:42,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:21:42 BoogieIcfgContainer [2019-01-14 02:21:42,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:21:42,015 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:21:42,015 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:21:42,020 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:21:42,021 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:21:42,021 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:21:41" (1/3) ... [2019-01-14 02:21:42,022 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d97d1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:21:42, skipping insertion in model container [2019-01-14 02:21:42,022 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:21:42,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:41" (2/3) ... [2019-01-14 02:21:42,023 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d97d1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:21:42, skipping insertion in model container [2019-01-14 02:21:42,023 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:21:42,023 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:21:42" (3/3) ... [2019-01-14 02:21:42,025 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.08_true-termination_true-no-overflow.c [2019-01-14 02:21:42,086 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:21:42,087 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:21:42,088 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:21:42,088 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:21:42,088 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:21:42,088 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:21:42,088 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:21:42,089 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:21:42,089 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:21:42,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:21:42,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:21:42,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:42,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:42,154 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:21:42,155 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:21:42,155 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:21:42,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:21:42,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:21:42,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:42,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:42,159 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:21:42,159 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:21:42,168 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~i~0, main_~j~0;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 8#L10-2true [2019-01-14 02:21:42,168 INFO L796 eck$LassoCheckResult]: Loop: 8#L10-2true assume !!(main_~i~0 >= 0);main_~j~0 := 0; 3#L12-2true assume !(main_~j~0 <= main_~i~0 - 1); 10#L12-3true main_~i~0 := main_~i~0 - 1; 8#L10-2true [2019-01-14 02:21:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:42,175 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:21:42,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:42,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:42,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:42,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:42,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:42,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-14 02:21:42,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:42,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:42,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:42,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:42,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:42,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:42,317 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2019-01-14 02:21:42,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:42,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:42,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:42,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:42,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:42,541 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:21:42,560 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:42,561 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:42,562 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:42,563 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:42,563 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:21:42,563 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:42,563 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:42,563 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:42,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.08_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:21:42,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:42,564 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:42,597 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:21:42,617 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:21:42,627 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:21:42,949 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 02:21:42,958 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:42,959 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:42,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:42,967 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:43,018 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:43,019 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) [2019-01-14 02:21:43,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:43,029 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:43,079 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:43,080 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) [2019-01-14 02:21:43,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:43,091 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:21:43,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:21:43,144 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:43,201 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:21:43,204 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:43,205 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:43,205 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:43,205 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:43,205 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:21:43,205 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:43,205 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:43,206 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:43,206 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.08_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:21:43,206 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:43,206 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:43,209 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:21:43,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:21:43,247 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:21:43,492 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:43,497 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:21:43,499 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:21:43,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:43,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:43,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:43,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:43,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:21:43,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:21:43,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:21:43,519 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:21:43,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:43,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:43,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:43,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:43,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:21:43,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:21:43,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:21:43,539 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:21:43,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:43,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:21:43,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:43,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:43,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:43,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:21:43,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:21:43,563 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:21:43,569 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:21:43,570 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:21:43,573 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:21:43,574 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:21:43,574 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:21:43,575 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-01-14 02:21:43,576 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:21:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:43,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:43,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:43,800 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:21:43,815 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:21:43,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-01-14 02:21:43,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 23 states and 35 transitions. Complement of second has 7 states. [2019-01-14 02:21:43,884 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:21:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:21:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-01-14 02:21:43,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-14 02:21:43,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:43,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:21:43,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:43,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-14 02:21:43,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:43,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 35 transitions. [2019-01-14 02:21:43,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:21:43,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-14 02:21:43,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:21:43,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:21:43,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-14 02:21:43,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:21:43,907 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:21:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-14 02:21:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-14 02:21:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:21:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-14 02:21:43,937 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-14 02:21:43,937 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-14 02:21:43,938 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:21:43,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. [2019-01-14 02:21:43,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:21:43,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:43,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:43,939 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:21:43,940 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:21:43,940 INFO L794 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~i~0, main_~j~0;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 74#L10-2 assume !!(main_~i~0 >= 0);main_~j~0 := 0; 70#L12-2 [2019-01-14 02:21:43,940 INFO L796 eck$LassoCheckResult]: Loop: 70#L12-2 assume !!(main_~j~0 <= main_~i~0 - 1);main_~j~0 := 1 + main_~j~0; 70#L12-2 [2019-01-14 02:21:43,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:43,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:21:43,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:43,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:43,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:43,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:43,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-14 02:21:43,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:43,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:43,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:43,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:43,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:43,963 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-14 02:21:43,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:43,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:43,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:43,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:43,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:44,013 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:44,013 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:44,014 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:44,014 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:44,014 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:21:44,014 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:44,015 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:44,015 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:44,015 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.08_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:21:44,016 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:44,016 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:44,017 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:21:44,028 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:21:44,040 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:21:44,146 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:44,147 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:21:44,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:44,152 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:44,174 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:44,174 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:21:44,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:44,180 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:44,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:21:44,213 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:44,340 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:21:44,342 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:44,342 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:44,343 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:44,343 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:44,343 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:21:44,343 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:44,343 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:44,343 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:44,343 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.08_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:21:44,344 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:44,346 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:44,348 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:21:44,354 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:21:44,367 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:21:44,597 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:44,597 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:21:44,598 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:21:44,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:44,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:44,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:44,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:44,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:21:44,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:21:44,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:21:44,612 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:21:44,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:44,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:21:44,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:44,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:44,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:44,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:21:44,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:21:44,625 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:21:44,632 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:21:44,632 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:21:44,633 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:21:44,633 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:21:44,633 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:21:44,634 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:21:44,634 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:21:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:44,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:44,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:44,945 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:21:44,946 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:21:44,946 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-01-14 02:21:44,994 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 13 states and 18 transitions. Complement of second has 5 states. [2019-01-14 02:21:44,996 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:21:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:21:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:21:44,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-01-14 02:21:44,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:44,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 02:21:44,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:44,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:21:44,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:45,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2019-01-14 02:21:45,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:21:45,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 13 transitions. [2019-01-14 02:21:45,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:21:45,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:21:45,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-14 02:21:45,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:21:45,003 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:21:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-14 02:21:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2019-01-14 02:21:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:21:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-14 02:21:45,005 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:21:45,005 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:21:45,005 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:21:45,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2019-01-14 02:21:45,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:21:45,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:45,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:45,007 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-14 02:21:45,007 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:21:45,007 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~i~0, main_~j~0;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 122#L10-2 assume !!(main_~i~0 >= 0);main_~j~0 := 0; 119#L12-2 assume !(main_~j~0 <= main_~i~0 - 1); 120#L12-3 main_~i~0 := main_~i~0 - 1; 123#L10-2 assume !!(main_~i~0 >= 0);main_~j~0 := 0; 118#L12-2 [2019-01-14 02:21:45,008 INFO L796 eck$LassoCheckResult]: Loop: 118#L12-2 assume !!(main_~j~0 <= main_~i~0 - 1);main_~j~0 := 1 + main_~j~0; 118#L12-2 [2019-01-14 02:21:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash 29867642, now seen corresponding path program 2 times [2019-01-14 02:21:45,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:45,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:45,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:45,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:45,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:21:45,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:21:45,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:21:45,083 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:21:45,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:45,083 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-14 02:21:45,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:45,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:45,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:45,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:21:45,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:45,118 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:45,118 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:45,118 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:45,118 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:45,119 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:21:45,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:45,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:45,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:45,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.08_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:21:45,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:45,119 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:45,121 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:21:45,128 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:21:45,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:21:45,330 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:45,330 INFO L412 LassoAnalysis]: Checking for nontermination... 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:21:45,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:45,335 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:45,357 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:45,357 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:21:45,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:45,365 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:21:45,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:21:45,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:45,522 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:21:45,525 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:45,525 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:45,525 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:45,525 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:45,525 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:21:45,525 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:45,525 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:45,526 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:45,526 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.08_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:21:45,526 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:45,526 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:45,528 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:21:45,544 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:21:45,552 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:21:45,650 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:45,651 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:21:45,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:21:45,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:45,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:21:45,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:45,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:45,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:45,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:21:45,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:21:45,659 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:21:45,663 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:21:45,664 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:21:45,664 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:21:45,664 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:21:45,664 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:21:45,665 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-14 02:21:45,665 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:21:45,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:45,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:45,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:45,714 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:21:45,714 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:21:45,715 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:21:45,754 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 15 transitions. Complement of second has 5 states. [2019-01-14 02:21:45,756 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:21:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:21:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:21:45,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:21:45,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:45,757 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:21:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:45,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:45,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:45,824 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:21:45,825 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:21:45,825 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:21:45,849 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 15 transitions. Complement of second has 5 states. [2019-01-14 02:21:45,849 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:21:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:21:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:21:45,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:21:45,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:45,851 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:21:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:45,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:45,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:45,904 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:21:45,904 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:21:45,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:21:45,936 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 9 states and 11 transitions. Complement of second has 4 states. [2019-01-14 02:21:45,938 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:21:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:21:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-14 02:21:45,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:21:45,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:45,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 02:21:45,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:45,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:21:45,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:45,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-14 02:21:45,942 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:21:45,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-14 02:21:45,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:21:45,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:21:45,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:21:45,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:21:45,943 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:45,943 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:45,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:21:45,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:21:45,949 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-14 02:21:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:21:45,952 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:21:45,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:21:45,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:21:45,953 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:21:45,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:21:45,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:21:45,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:21:45,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:21:45,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:21:45,953 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:45,954 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:45,954 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:45,954 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:21:45,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:21:45,954 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:21:45,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:21:45,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:21:45 BoogieIcfgContainer [2019-01-14 02:21:45,963 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:21:45,964 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:21:45,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:21:45,964 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:21:45,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:21:42" (3/4) ... [2019-01-14 02:21:45,969 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:21:45,969 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:21:45,970 INFO L168 Benchmark]: Toolchain (without parser) took 4690.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 952.7 MB in the beginning and 918.1 MB in the end (delta: 34.6 MB). Peak memory consumption was 165.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:45,972 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:21:45,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:45,974 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.87 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:21:45,974 INFO L168 Benchmark]: Boogie Preprocessor took 30.43 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:21:45,975 INFO L168 Benchmark]: RCFGBuilder took 371.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:45,976 INFO L168 Benchmark]: BuchiAutomizer took 3948.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 918.1 MB in the end (delta: 192.6 MB). Peak memory consumption was 192.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:45,977 INFO L168 Benchmark]: Witness Printer took 5.74 ms. Allocated memory is still 1.2 GB. Free memory is still 918.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:21:45,981 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 273.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.87 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.43 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 371.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3948.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 918.1 MB in the end (delta: 192.6 MB). Peak memory consumption was 192.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.74 ms. Allocated memory is still 1.2 GB. Free memory is still 918.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * j + i and consists of 3 locations. One nondeterministic module has affine ranking function i + -1 * j and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 21 SDslu, 6 SDs, 0 SdLazy, 39 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax187 hnf98 lsp53 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp96 dnf100 smp100 tf110 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...