./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/c.02_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.02_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 c3e40038ef85c6e1a2de0a898912241a10300c47 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:34,393 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:21:34,395 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:21:34,407 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:21:34,407 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:21:34,408 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:21:34,410 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:21:34,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:21:34,413 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:21:34,414 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:21:34,415 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:21:34,415 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:21:34,416 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:21:34,417 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:21:34,418 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:21:34,419 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:21:34,420 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:21:34,422 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:21:34,424 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:21:34,425 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:21:34,426 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:21:34,428 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:21:34,430 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:21:34,430 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:21:34,431 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:21:34,432 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:21:34,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:21:34,433 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:21:34,434 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:21:34,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:21:34,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:21:34,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:21:34,437 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:21:34,437 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:21:34,441 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:21:34,443 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:21:34,444 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:34,477 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:21:34,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:21:34,481 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:21:34,481 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:21:34,481 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:21:34,482 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:21:34,483 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:21:34,483 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:21:34,483 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:21:34,484 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:21:34,484 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:21:34,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:21:34,484 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:21:34,484 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:21:34,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:21:34,486 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:21:34,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:21:34,487 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:21:34,487 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:21:34,487 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:21:34,487 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:21:34,487 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:21:34,487 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:21:34,488 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:21:34,490 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:21:34,490 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:21:34,490 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:21:34,491 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:21:34,492 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:21:34,492 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 -> c3e40038ef85c6e1a2de0a898912241a10300c47 [2019-01-14 02:21:34,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:21:34,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:21:34,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:21:34,575 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:21:34,576 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:21:34,576 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/c.02_true-termination_true-no-overflow.c [2019-01-14 02:21:34,631 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed35023be/60463f26844c4a2d938b29fda317cddf/FLAGc2eebbf84 [2019-01-14 02:21:35,025 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:21:35,025 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/c.02_true-termination_true-no-overflow.c [2019-01-14 02:21:35,031 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed35023be/60463f26844c4a2d938b29fda317cddf/FLAGc2eebbf84 [2019-01-14 02:21:35,419 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed35023be/60463f26844c4a2d938b29fda317cddf [2019-01-14 02:21:35,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:21:35,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:21:35,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:21:35,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:21:35,429 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:21:35,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:21:35" (1/1) ... [2019-01-14 02:21:35,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3328df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:35, skipping insertion in model container [2019-01-14 02:21:35,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:21:35" (1/1) ... [2019-01-14 02:21:35,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:21:35,456 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:21:35,662 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:21:35,667 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:21:35,682 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:21:35,695 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:21:35,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:35 WrapperNode [2019-01-14 02:21:35,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:21:35,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:21:35,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:21:35,696 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:21:35,703 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:35" (1/1) ... [2019-01-14 02:21:35,709 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:35" (1/1) ... [2019-01-14 02:21:35,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:21:35,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:21:35,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:21:35,726 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:21:35,734 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:35" (1/1) ... [2019-01-14 02:21:35,734 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:35" (1/1) ... [2019-01-14 02:21:35,735 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:35" (1/1) ... [2019-01-14 02:21:35,735 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:35" (1/1) ... [2019-01-14 02:21:35,737 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:35" (1/1) ... [2019-01-14 02:21:35,742 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:35" (1/1) ... [2019-01-14 02:21:35,742 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:35" (1/1) ... [2019-01-14 02:21:35,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:21:35,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:21:35,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:21:35,744 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:21:35,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:35,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:21:35,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:21:36,019 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:21:36,020 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:21:36,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:21:36 BoogieIcfgContainer [2019-01-14 02:21:36,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:21:36,022 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:21:36,022 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:21:36,026 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:21:36,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:21:36,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:21:35" (1/3) ... [2019-01-14 02:21:36,027 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5815507b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:21:36, skipping insertion in model container [2019-01-14 02:21:36,028 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:21:36,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:35" (2/3) ... [2019-01-14 02:21:36,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5815507b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:21:36, skipping insertion in model container [2019-01-14 02:21:36,028 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:21:36,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:21:36" (3/3) ... [2019-01-14 02:21:36,030 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.02_true-termination_true-no-overflow.c [2019-01-14 02:21:36,082 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:21:36,083 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:21:36,083 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:21:36,083 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:21:36,083 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:21:36,083 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:21:36,083 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:21:36,083 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:21:36,083 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:21:36,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:21:36,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:21:36,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:36,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:36,126 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:21:36,126 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:21:36,127 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:21:36,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:21:36,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:21:36,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:36,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:36,128 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:21:36,129 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:21:36,137 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 9#L10-2true [2019-01-14 02:21:36,138 INFO L796 eck$LassoCheckResult]: Loop: 9#L10-2true assume !!(main_~x~0 >= 0 && main_~x~0 < 2147483647);main_~x~0 := 1 + main_~x~0;main_~y~0 := 1; 5#L13-2true assume !(main_~x~0 > main_~y~0); 3#L13-3true main_~x~0 := main_~x~0 - 2; 9#L10-2true [2019-01-14 02:21:36,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:36,147 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:21:36,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:36,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:36,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:36,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:36,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:36,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:36,239 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-14 02:21:36,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:36,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:36,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:36,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:36,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:36,268 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2019-01-14 02:21:36,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:36,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:36,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:36,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:36,504 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-14 02:21:36,554 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:36,556 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:36,556 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:36,556 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:36,556 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:21:36,556 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:36,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:36,557 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:36,557 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:21:36,557 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:36,557 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:36,580 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:36,629 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:36,666 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:36,810 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 02:21:36,988 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-14 02:21:37,203 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:37,203 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:37,216 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:37,217 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:37,245 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:37,245 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:21:37,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:37,252 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:37,274 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:37,274 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:37,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:37,283 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:37,308 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:21:37,309 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:37,334 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:21:37,336 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:37,336 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:37,336 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:37,336 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:37,336 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:21:37,337 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:37,337 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:37,337 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:37,337 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:21:37,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:37,338 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:37,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:21:37,358 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:37,383 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:37,504 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:37,509 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:21:37,511 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:37,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:37,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:37,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:37,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:37,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:21:37,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:21:37,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:21:37,527 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:37,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:37,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:21:37,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:37,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:37,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:37,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:21:37,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:21:37,539 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:21:37,545 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:21:37,546 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:21:37,548 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:21:37,548 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:21:37,548 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:21:37,549 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2019-01-14 02:21:37,550 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:21:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:37,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:37,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:37,809 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:37,823 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:37,824 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-01-14 02:21:37,889 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:37,890 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:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:21:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-01-14 02:21:37,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-14 02:21:37,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:37,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:21:37,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:37,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-14 02:21:37,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:37,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 35 transitions. [2019-01-14 02:21:37,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:21:37,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-14 02:21:37,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:21:37,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:21:37,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-14 02:21:37,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:21:37,907 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:21:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-14 02:21:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-14 02:21:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:21:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-14 02:21:37,933 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-14 02:21:37,933 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-14 02:21:37,933 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:21:37,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. [2019-01-14 02:21:37,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:21:37,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:37,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:37,934 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:21:37,934 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:21:37,935 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 73#L10-2 assume !!(main_~x~0 >= 0 && main_~x~0 < 2147483647);main_~x~0 := 1 + main_~x~0;main_~y~0 := 1; 74#L13-2 [2019-01-14 02:21:37,935 INFO L796 eck$LassoCheckResult]: Loop: 74#L13-2 assume !!(main_~x~0 > main_~y~0);main_~y~0 := 1 + main_~y~0; 74#L13-2 [2019-01-14 02:21:37,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:21:37,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:37,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:37,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:37,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:37,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-14 02:21:37,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:37,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:37,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:37,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:37,954 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-14 02:21:37,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:37,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:37,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:37,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:37,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:37,986 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:37,986 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:37,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:37,987 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:37,987 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:21:37,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:37,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:37,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:37,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:21:37,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:37,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:37,990 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:37,999 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:38,008 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:38,145 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:38,145 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:38,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:38,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:38,174 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:38,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:38,178 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:38,179 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:38,200 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:38,200 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:21:38,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:38,206 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:21:38,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:21:38,233 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:38,348 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:21:38,350 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:38,350 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:38,350 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:38,351 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:38,351 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:21:38,351 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:38,351 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:38,351 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:38,352 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:21:38,352 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:38,352 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:38,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:38,363 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:38,369 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:38,851 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:38,852 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:21:38,852 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:38,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:38,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:38,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:38,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:38,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:21:38,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:21:38,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:21:38,870 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:38,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:38,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:38,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:38,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:38,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:21:38,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:21:38,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:21:38,895 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:38,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:38,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:21:38,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:38,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:38,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:38,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:21:38,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:21:38,905 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:21:38,912 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:21:38,913 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:21:38,913 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:21:38,913 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:21:38,914 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:21:38,914 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-14 02:21:38,915 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:21:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:38,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:38,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:38,964 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:38,964 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:38,964 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-01-14 02:21:38,990 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:38,992 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:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:21:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:21:38,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-01-14 02:21:38,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:38,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 02:21:38,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:38,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:21:38,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:38,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2019-01-14 02:21:38,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:21:38,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 13 transitions. [2019-01-14 02:21:38,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:21:38,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:21:38,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-14 02:21:38,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:21:38,997 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:21:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-14 02:21:38,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2019-01-14 02:21:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:21:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-14 02:21:38,998 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:21:38,999 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:21:38,999 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:21:38,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2019-01-14 02:21:38,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:21:39,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:39,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:39,001 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-14 02:21:39,001 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:21:39,001 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 121#L10-2 assume !!(main_~x~0 >= 0 && main_~x~0 < 2147483647);main_~x~0 := 1 + main_~x~0;main_~y~0 := 1; 123#L13-2 assume !(main_~x~0 > main_~y~0); 118#L13-3 main_~x~0 := main_~x~0 - 2; 119#L10-2 assume !!(main_~x~0 >= 0 && main_~x~0 < 2147483647);main_~x~0 := 1 + main_~x~0;main_~y~0 := 1; 122#L13-2 [2019-01-14 02:21:39,002 INFO L796 eck$LassoCheckResult]: Loop: 122#L13-2 assume !!(main_~x~0 > main_~y~0);main_~y~0 := 1 + main_~y~0; 122#L13-2 [2019-01-14 02:21:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash 29867642, now seen corresponding path program 2 times [2019-01-14 02:21:39,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:39,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:39,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:39,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:39,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:39,065 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:39,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:21:39,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:21:39,070 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:21:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:39,070 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-14 02:21:39,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:39,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:39,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:39,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:21:39,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:39,115 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:39,116 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:39,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:39,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:39,116 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:21:39,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:39,117 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:39,117 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:39,117 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:21:39,117 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:39,117 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:39,118 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:39,127 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:39,144 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:39,227 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:39,228 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:21:39,235 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:39,235 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:39,257 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:39,257 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:39,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:39,263 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:39,287 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:21:39,288 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:39,400 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:21:39,402 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:39,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:39,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:39,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:39,403 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:21:39,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:39,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:39,404 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:39,404 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:21:39,404 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:39,404 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:39,406 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:39,411 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:39,422 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:39,565 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:39,565 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:21:39,566 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:39,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:39,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:39,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:39,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:39,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:21:39,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:21:39,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:21:39,577 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:39,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:39,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:21:39,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:39,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:39,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:39,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:21:39,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:21:39,586 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:21:39,590 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:21:39,590 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:21:39,591 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:21:39,591 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:21:39,591 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:21:39,591 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-14 02:21:39,592 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:21:39,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:39,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:39,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:39,663 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:39,663 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:39,663 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:21:39,694 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:39,695 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:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:21:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:21:39,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:21:39,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:39,696 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:21:39,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:39,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:39,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:39,770 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:39,771 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:39,771 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:21:39,788 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:39,789 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:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:21:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:21:39,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:21:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:39,790 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:21:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:39,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:39,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:39,858 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:39,858 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:39,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:21:39,888 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:39,889 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:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:21:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-14 02:21:39,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:21:39,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:39,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 02:21:39,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:39,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:21:39,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:39,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-14 02:21:39,893 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:21:39,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-14 02:21:39,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:21:39,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:21:39,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:21:39,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:21:39,894 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:39,894 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:39,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:21:39,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:21:39,899 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-14 02:21:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:21:39,902 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:21:39,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:21:39,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:21:39,903 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:21:39,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:21:39,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:21:39,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:21:39,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:21:39,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:21:39,904 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:39,904 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:39,904 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:39,904 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:21:39,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:21:39,904 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:21:39,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:21:39,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:21:39 BoogieIcfgContainer [2019-01-14 02:21:39,911 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:21:39,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:21:39,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:21:39,912 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:21:39,912 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:36" (3/4) ... [2019-01-14 02:21:39,915 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:21:39,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:21:39,916 INFO L168 Benchmark]: Toolchain (without parser) took 4492.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Free memory was 951.4 MB in the beginning and 817.7 MB in the end (delta: 133.6 MB). Peak memory consumption was 190.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:39,917 INFO L168 Benchmark]: CDTParser took 0.15 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:39,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.98 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:39,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.12 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:21:39,920 INFO L168 Benchmark]: Boogie Preprocessor took 17.97 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:21:39,921 INFO L168 Benchmark]: RCFGBuilder took 277.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -96.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:39,923 INFO L168 Benchmark]: BuchiAutomizer took 3888.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 824.8 MB in the end (delta: 212.5 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:39,924 INFO L168 Benchmark]: Witness Printer took 3.99 ms. Allocated memory is still 1.1 GB. Free memory was 824.8 MB in the beginning and 817.7 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:39,930 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.15 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 269.98 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.12 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.97 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 277.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -96.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3888.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 824.8 MB in the end (delta: 212.5 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.99 ms. Allocated memory is still 1.1 GB. Free memory was 824.8 MB in the beginning and 817.7 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. 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 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * y + x and consists of 3 locations. One nondeterministic module has affine ranking function -1 * y + x 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 3.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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, 18 SDslu, 6 SDs, 0 SdLazy, 42 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax202 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf93 smp96 dnf100 smp100 tf111 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...