./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/UpAndDown_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-restricted-15/UpAndDown_false-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 014f994c3374ea132faaa71956bb80ddfc4c8f9b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:17:25,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:17:25,983 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:17:26,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:17:26,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:17:26,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:17:26,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:17:26,014 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:17:26,016 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:17:26,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:17:26,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:17:26,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:17:26,025 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:17:26,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:17:26,030 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:17:26,031 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:17:26,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:17:26,033 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:17:26,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:17:26,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:17:26,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:17:26,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:17:26,043 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:17:26,043 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:17:26,043 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:17:26,045 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:17:26,046 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:17:26,047 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:17:26,048 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:17:26,049 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:17:26,049 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:17:26,050 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:17:26,050 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:17:26,051 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:17:26,052 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:17:26,053 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:17:26,053 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:17:26,075 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:17:26,076 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:17:26,077 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:17:26,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:17:26,077 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:17:26,077 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:17:26,078 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:17:26,078 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:17:26,078 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:17:26,078 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:17:26,078 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:17:26,079 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:17:26,079 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:17:26,079 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:17:26,079 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:17:26,079 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:17:26,080 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:17:26,080 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:17:26,080 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:17:26,080 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:17:26,080 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:17:26,080 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:17:26,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:17:26,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:17:26,081 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:17:26,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:17:26,081 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:17:26,081 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:17:26,082 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:17:26,083 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 -> 014f994c3374ea132faaa71956bb80ddfc4c8f9b [2018-11-28 23:17:26,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:17:26,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:17:26,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:17:26,137 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:17:26,137 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:17:26,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/UpAndDown_false-termination_true-no-overflow.c [2018-11-28 23:17:26,199 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f17a1855/1dfd61fe3d3e460ba9fe283f47f44746/FLAG5018bdc19 [2018-11-28 23:17:26,678 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:17:26,679 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/UpAndDown_false-termination_true-no-overflow.c [2018-11-28 23:17:26,685 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f17a1855/1dfd61fe3d3e460ba9fe283f47f44746/FLAG5018bdc19 [2018-11-28 23:17:27,017 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f17a1855/1dfd61fe3d3e460ba9fe283f47f44746 [2018-11-28 23:17:27,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:17:27,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:17:27,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:17:27,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:17:27,029 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:17:27,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:27" (1/1) ... [2018-11-28 23:17:27,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e78fa9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27, skipping insertion in model container [2018-11-28 23:17:27,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:27" (1/1) ... [2018-11-28 23:17:27,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:17:27,062 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:17:27,300 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:17:27,306 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:17:27,328 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:17:27,346 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:17:27,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27 WrapperNode [2018-11-28 23:17:27,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:17:27,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:17:27,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:17:27,348 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:17:27,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27" (1/1) ... [2018-11-28 23:17:27,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27" (1/1) ... [2018-11-28 23:17:27,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:17:27,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:17:27,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:17:27,393 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:17:27,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27" (1/1) ... [2018-11-28 23:17:27,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27" (1/1) ... [2018-11-28 23:17:27,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27" (1/1) ... [2018-11-28 23:17:27,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27" (1/1) ... [2018-11-28 23:17:27,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27" (1/1) ... [2018-11-28 23:17:27,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27" (1/1) ... [2018-11-28 23:17:27,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27" (1/1) ... [2018-11-28 23:17:27,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:17:27,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:17:27,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:17:27,421 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:17:27,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:17:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:17:27,757 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:17:27,757 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:17:27,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:27 BoogieIcfgContainer [2018-11-28 23:17:27,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:17:27,759 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:17:27,759 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:17:27,763 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:17:27,764 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:27,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:17:27" (1/3) ... [2018-11-28 23:17:27,765 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@420f6981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:17:27, skipping insertion in model container [2018-11-28 23:17:27,765 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:27,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:27" (2/3) ... [2018-11-28 23:17:27,766 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@420f6981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:17:27, skipping insertion in model container [2018-11-28 23:17:27,766 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:27,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:27" (3/3) ... [2018-11-28 23:17:27,768 INFO L375 chiAutomizerObserver]: Analyzing ICFG UpAndDown_false-termination_true-no-overflow.c [2018-11-28 23:17:27,831 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:17:27,831 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:17:27,832 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:17:27,832 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:17:27,832 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:17:27,832 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:17:27,832 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:17:27,832 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:17:27,832 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:17:27,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-28 23:17:27,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:17:27,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:27,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:27,888 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:17:27,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:17:27,888 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:17:27,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-28 23:17:27,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:17:27,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:27,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:27,891 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:17:27,892 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:17:27,899 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5#L18-1true [2018-11-28 23:17:27,900 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6#L12true assume 10 == main_~i~0;main_~up~0 := 0; 3#L12-2true assume 0 == main_~i~0;main_~up~0 := 1; 9#L15-1true assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2018-11-28 23:17:27,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:27,907 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 23:17:27,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:27,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:27,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:27,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:27,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2018-11-28 23:17:28,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:28,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:28,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:17:28,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:17:28,112 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:17:28,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:17:28,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:17:28,132 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-11-28 23:17:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:28,333 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-11-28 23:17:28,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:17:28,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-28 23:17:28,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:17:28,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 9 states and 14 transitions. [2018-11-28 23:17:28,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:17:28,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:17:28,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2018-11-28 23:17:28,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:17:28,348 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-11-28 23:17:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2018-11-28 23:17:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-28 23:17:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:17:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-11-28 23:17:28,381 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-11-28 23:17:28,381 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-11-28 23:17:28,381 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:17:28,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2018-11-28 23:17:28,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:17:28,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:28,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:28,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:17:28,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:17:28,384 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 38#L18-1 [2018-11-28 23:17:28,384 INFO L796 eck$LassoCheckResult]: Loop: 38#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 43#L12 assume 10 == main_~i~0;main_~up~0 := 0; 35#L12-2 assume !(0 == main_~i~0); 36#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 38#L18-1 [2018-11-28 23:17:28,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-28 23:17:28,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:28,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:28,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:28,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2018-11-28 23:17:28,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:28,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:28,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:28,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,412 INFO L82 PathProgramCache]: Analyzing trace with hash 29863753, now seen corresponding path program 1 times [2018-11-28 23:17:28,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:28,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,536 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:28,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:28,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:28,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:28,538 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:28,538 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:28,538 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:28,539 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:28,539 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:17:28,539 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:28,539 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:28,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,856 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 23:17:28,966 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:28,967 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 [2018-11-28 23:17:28,972 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:28,973 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:29,000 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:29,000 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 [2018-11-28 23:17:29,006 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:29,006 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:29,029 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:29,029 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:29,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:29,035 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:29,039 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:29,040 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:29,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:29,060 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:17:29,086 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:29,086 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:29,102 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:29,120 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:29,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:29,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:29,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:29,121 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:29,121 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:29,121 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:29,121 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:29,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:17:29,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:29,121 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:29,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,298 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:29,304 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:29,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:29,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:29,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:29,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:29,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:29,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:29,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:29,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:29,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:29,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:29,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:29,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:29,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:29,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:29,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:29,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:29,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:29,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:29,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:29,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:29,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:29,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:29,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:29,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:29,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:29,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:29,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:29,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:29,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:29,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:29,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:29,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:29,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:29,384 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:29,392 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:29,393 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:17:29,396 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:29,396 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:29,397 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:29,397 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:17:29,400 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:29,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:29,561 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 [2018-11-28 23:17:29,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:17:29,702 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 32 transitions. Complement of second has 5 states. [2018-11-28 23:17:29,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:17:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:17:29,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-28 23:17:29,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:29,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:17:29,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:29,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 8 letters. [2018-11-28 23:17:29,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:29,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 32 transitions. [2018-11-28 23:17:29,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:17:29,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 32 transitions. [2018-11-28 23:17:29,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:17:29,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:17:29,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2018-11-28 23:17:29,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:29,715 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2018-11-28 23:17:29,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2018-11-28 23:17:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-28 23:17:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:17:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-11-28 23:17:29,719 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-28 23:17:29,719 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-28 23:17:29,720 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:17:29,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2018-11-28 23:17:29,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:17:29,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:29,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:29,723 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:17:29,724 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:17:29,724 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 106#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 110#L12 assume 10 == main_~i~0;main_~up~0 := 0; 112#L12-2 assume !(0 == main_~i~0); 120#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2018-11-28 23:17:29,724 INFO L796 eck$LassoCheckResult]: Loop: 107#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 108#L12 assume 10 == main_~i~0;main_~up~0 := 0; 117#L12-2 assume !(0 == main_~i~0); 118#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2018-11-28 23:17:29,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,724 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2018-11-28 23:17:29,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:29,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:29,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:29,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:29,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:17:29,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:17:29,749 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:29,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1234600, now seen corresponding path program 1 times [2018-11-28 23:17:29,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:29,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:29,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:29,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:17:29,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:17:29,767 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:17:29,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:17:29,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:17:29,768 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 23:17:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:29,803 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2018-11-28 23:17:29,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:17:29,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 43 transitions. [2018-11-28 23:17:29,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 23:17:29,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 39 transitions. [2018-11-28 23:17:29,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 23:17:29,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 23:17:29,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 39 transitions. [2018-11-28 23:17:29,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:29,808 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 39 transitions. [2018-11-28 23:17:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 39 transitions. [2018-11-28 23:17:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-28 23:17:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:17:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2018-11-28 23:17:29,814 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 38 transitions. [2018-11-28 23:17:29,814 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 38 transitions. [2018-11-28 23:17:29,814 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:17:29,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 38 transitions. [2018-11-28 23:17:29,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:17:29,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:29,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:29,820 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:17:29,820 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:17:29,820 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 162#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 166#L12 assume !(10 == main_~i~0); 168#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 172#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 173#L18-1 [2018-11-28 23:17:29,820 INFO L796 eck$LassoCheckResult]: Loop: 173#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 178#L12 assume !(10 == main_~i~0); 176#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 174#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 173#L18-1 [2018-11-28 23:17:29,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 1 times [2018-11-28 23:17:29,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:29,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2018-11-28 23:17:29,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:29,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:29,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:29,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,841 INFO L82 PathProgramCache]: Analyzing trace with hash -760725642, now seen corresponding path program 2 times [2018-11-28 23:17:29,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:29,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:29,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:29,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:29,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:17:29,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:17:29,943 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:29,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:29,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:29,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:29,943 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:29,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:29,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:29,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:29,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:17:29,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:29,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:29,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:30,151 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 23:17:30,450 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:30,451 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:30,454 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:30,454 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:30,474 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:30,474 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:30,478 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:30,479 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:30,498 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:30,498 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 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 [2018-11-28 23:17:30,503 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:30,503 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:30,513 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:30,513 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=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 [2018-11-28 23:17:30,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:30,535 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 [2018-11-28 23:17:30,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:30,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:30,562 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:30,580 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:30,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:30,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:30,580 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:30,580 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:30,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:30,581 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:30,581 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:30,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:17:30,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:30,581 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:30,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:30,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:30,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:30,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:30,814 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:30,814 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:30,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:30,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:30,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:30,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:30,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:30,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:30,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:30,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:30,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:30,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:30,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:30,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:30,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:30,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:30,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:30,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:30,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:30,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:30,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:30,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:30,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:30,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:30,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:30,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:30,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:30,871 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:30,871 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:30,872 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:30,872 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:30,872 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:30,872 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-28 23:17:30,873 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:30,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:30,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:30,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:30,970 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 [2018-11-28 23:17:30,970 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 38 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-28 23:17:31,028 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 38 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 42 states and 62 transitions. Complement of second has 7 states. [2018-11-28 23:17:31,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:17:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:17:31,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:17:31,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:31,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 23:17:31,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:31,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-28 23:17:31,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:31,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2018-11-28 23:17:31,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 23:17:31,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 40 states and 60 transitions. [2018-11-28 23:17:31,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 23:17:31,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-28 23:17:31,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 60 transitions. [2018-11-28 23:17:31,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:31,038 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2018-11-28 23:17:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 60 transitions. [2018-11-28 23:17:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-28 23:17:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 23:17:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2018-11-28 23:17:31,044 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 56 transitions. [2018-11-28 23:17:31,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:17:31,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:17:31,045 INFO L87 Difference]: Start difference. First operand 37 states and 56 transitions. Second operand 4 states. [2018-11-28 23:17:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:31,096 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2018-11-28 23:17:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:17:31,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 61 transitions. [2018-11-28 23:17:31,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-28 23:17:31,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 56 transitions. [2018-11-28 23:17:31,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 23:17:31,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 23:17:31,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 56 transitions. [2018-11-28 23:17:31,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:31,102 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 56 transitions. [2018-11-28 23:17:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 56 transitions. [2018-11-28 23:17:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-11-28 23:17:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:17:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2018-11-28 23:17:31,106 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2018-11-28 23:17:31,106 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2018-11-28 23:17:31,106 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:17:31,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2018-11-28 23:17:31,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 23:17:31,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:31,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:31,108 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:17:31,108 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:17:31,108 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 361#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 365#L12 assume !(10 == main_~i~0); 367#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 374#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 362#L18-1 [2018-11-28 23:17:31,109 INFO L796 eck$LassoCheckResult]: Loop: 362#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 363#L12 assume !(10 == main_~i~0); 356#L12-2 assume !(0 == main_~i~0); 357#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 362#L18-1 [2018-11-28 23:17:31,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:31,109 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 3 times [2018-11-28 23:17:31,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:31,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:31,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:31,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:31,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:31,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2018-11-28 23:17:31,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:31,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:31,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:31,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:31,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:31,126 INFO L82 PathProgramCache]: Analyzing trace with hash -760725580, now seen corresponding path program 1 times [2018-11-28 23:17:31,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:31,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:31,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:31,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:31,194 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:31,194 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:31,194 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:31,194 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:31,195 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:31,195 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:31,195 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:31,195 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:31,196 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 23:17:31,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:31,196 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:31,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,421 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:31,421 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:31,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:31,427 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:31,447 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:31,447 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:31,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:31,453 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:31,456 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:31,456 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:31,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:31,477 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:31,498 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:31,498 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:31,503 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:31,503 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:31,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:31,529 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:31,535 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:31,552 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:31,552 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:31,553 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:31,553 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:31,553 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:31,553 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:31,553 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:31,553 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:31,553 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 23:17:31,553 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:31,554 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:31,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,744 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:31,745 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:31,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:31,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:31,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:31,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:31,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:31,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:31,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:31,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:31,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:31,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:31,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:31,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:31,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:31,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:31,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:31,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:31,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:31,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:31,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:31,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:31,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:31,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:31,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:31,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:31,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:31,763 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:31,767 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:31,767 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:31,767 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:31,767 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:31,768 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:31,768 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2018-11-28 23:17:31,768 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:31,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:31,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:31,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:31,881 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:17:31,882 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-28 23:17:31,932 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 40 states and 57 transitions. Complement of second has 7 states. [2018-11-28 23:17:31,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:17:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 23:17:31,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:17:31,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:31,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 23:17:31,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:31,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-28 23:17:31,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:31,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 57 transitions. [2018-11-28 23:17:31,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 23:17:31,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 55 transitions. [2018-11-28 23:17:31,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 23:17:31,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-28 23:17:31,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 55 transitions. [2018-11-28 23:17:31,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:31,939 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-11-28 23:17:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 55 transitions. [2018-11-28 23:17:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-28 23:17:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 23:17:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2018-11-28 23:17:31,942 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2018-11-28 23:17:31,942 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2018-11-28 23:17:31,942 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:17:31,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 53 transitions. [2018-11-28 23:17:31,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 23:17:31,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:31,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:31,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-28 23:17:31,944 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:17:31,945 INFO L794 eck$LassoCheckResult]: Stem: 480#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 481#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 485#L12 assume !(10 == main_~i~0); 501#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 500#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 499#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 487#L12 assume 10 == main_~i~0;main_~up~0 := 0; 476#L12-2 [2018-11-28 23:17:31,945 INFO L796 eck$LassoCheckResult]: Loop: 476#L12-2 assume !(0 == main_~i~0); 477#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 511#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 509#L12 assume 10 == main_~i~0;main_~up~0 := 0; 476#L12-2 [2018-11-28 23:17:31,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:31,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918578, now seen corresponding path program 1 times [2018-11-28 23:17:31,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:31,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:31,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:31,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:32,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:17:32,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:17:32,040 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:32,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:32,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 2 times [2018-11-28 23:17:32,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:32,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:32,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:32,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:32,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:32,098 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:32,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:32,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:32,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:32,099 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:32,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:32,099 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:32,099 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:32,099 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 23:17:32,099 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:32,099 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:32,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,194 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:32,194 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:32,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:32,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:32,201 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:32,202 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:32,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:32,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:32,243 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:32,243 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:32,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:32,247 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:32,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:32,270 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:32,387 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:32,389 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:32,389 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:32,389 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:32,389 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:32,389 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:32,389 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:32,390 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:32,390 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:32,390 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 23:17:32,390 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:32,390 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:32,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,509 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:32,510 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:32,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:32,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:32,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:32,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:32,514 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:17:32,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:32,515 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:17:32,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:32,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:32,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 [2018-11-28 23:17:32,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:32,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:32,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:32,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:32,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:32,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:32,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:32,527 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:32,531 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:32,531 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:17:32,531 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:32,532 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:32,532 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:32,532 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:17:32,532 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:32,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:32,655 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:17:32,655 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-11-28 23:17:32,726 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 93 states and 141 transitions. Complement of second has 7 states. [2018-11-28 23:17:32,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:17:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:17:32,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 23:17:32,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:32,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-28 23:17:32,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:32,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-28 23:17:32,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:32,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 141 transitions. [2018-11-28 23:17:32,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-28 23:17:32,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 78 states and 116 transitions. [2018-11-28 23:17:32,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-28 23:17:32,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-28 23:17:32,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 116 transitions. [2018-11-28 23:17:32,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:32,735 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 116 transitions. [2018-11-28 23:17:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 116 transitions. [2018-11-28 23:17:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-28 23:17:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 23:17:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2018-11-28 23:17:32,742 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 115 transitions. [2018-11-28 23:17:32,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:17:32,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:17:32,744 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand 4 states. [2018-11-28 23:17:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:32,793 INFO L93 Difference]: Finished difference Result 105 states and 146 transitions. [2018-11-28 23:17:32,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:17:32,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 146 transitions. [2018-11-28 23:17:32,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2018-11-28 23:17:32,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 146 transitions. [2018-11-28 23:17:32,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-28 23:17:32,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-28 23:17:32,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 146 transitions. [2018-11-28 23:17:32,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:32,800 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 146 transitions. [2018-11-28 23:17:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 146 transitions. [2018-11-28 23:17:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2018-11-28 23:17:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 23:17:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2018-11-28 23:17:32,810 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 140 transitions. [2018-11-28 23:17:32,810 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 140 transitions. [2018-11-28 23:17:32,810 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:17:32,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 140 transitions. [2018-11-28 23:17:32,812 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2018-11-28 23:17:32,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:32,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:32,812 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-28 23:17:32,812 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:17:32,812 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 850#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 875#L12 assume !(10 == main_~i~0); 872#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 873#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 869#L12 assume !(10 == main_~i~0); 923#L12-2 assume !(0 == main_~i~0); 922#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 910#L18-1 [2018-11-28 23:17:32,813 INFO L796 eck$LassoCheckResult]: Loop: 910#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 921#L12 assume !(10 == main_~i~0); 919#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 917#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 910#L18-1 [2018-11-28 23:17:32,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:32,813 INFO L82 PathProgramCache]: Analyzing trace with hash -760725578, now seen corresponding path program 1 times [2018-11-28 23:17:32,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:32,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:32,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:32,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:32,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:17:32,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:17:32,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:17:32,846 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:32,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:32,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1236462, now seen corresponding path program 1 times [2018-11-28 23:17:32,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:32,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:32,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:32,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:32,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:32,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:17:32,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:17:32,894 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:17:32,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:17:32,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:17:32,895 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. cyclomatic complexity: 51 Second operand 3 states. [2018-11-28 23:17:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:32,906 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-11-28 23:17:32,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:17:32,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2018-11-28 23:17:32,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 23:17:32,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 51 states and 63 transitions. [2018-11-28 23:17:32,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 23:17:32,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 23:17:32,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2018-11-28 23:17:32,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:32,912 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-28 23:17:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2018-11-28 23:17:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-11-28 23:17:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 23:17:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-11-28 23:17:32,916 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-28 23:17:32,916 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-28 23:17:32,916 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:17:32,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2018-11-28 23:17:32,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 23:17:32,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:32,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:32,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2018-11-28 23:17:32,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:17:32,918 INFO L794 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1050#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1055#L12-2 assume !(0 == main_~i~0); 1030#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1031#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1048#L12 assume !(10 == main_~i~0); 1044#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1045#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1038#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1039#L12 assume !(10 == main_~i~0); 1034#L12-2 assume !(0 == main_~i~0); 1035#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1040#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1041#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1057#L12-2 [2018-11-28 23:17:32,918 INFO L796 eck$LassoCheckResult]: Loop: 1057#L12-2 assume !(0 == main_~i~0); 1028#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1029#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1058#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1057#L12-2 [2018-11-28 23:17:32,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:32,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1385122848, now seen corresponding path program 1 times [2018-11-28 23:17:32,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:32,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:32,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:32,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 23:17:32,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:32,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:32,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 23:17:33,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:33,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 23:17:33,001 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:33,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:33,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 3 times [2018-11-28 23:17:33,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:33,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:33,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:33,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:33,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:33,046 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:33,046 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:33,046 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:33,047 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:33,047 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:33,047 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:33,047 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:33,047 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:33,047 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration8_Loop [2018-11-28 23:17:33,047 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:33,047 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:33,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,159 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:33,159 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:33,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:33,163 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:33,185 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:33,185 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:33,305 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:33,307 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:33,307 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:33,307 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:33,307 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:33,307 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:33,307 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:33,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:33,308 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:33,308 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration8_Loop [2018-11-28 23:17:33,308 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:33,308 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:33,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,441 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:33,441 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:33,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:33,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:33,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:33,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:33,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:33,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:33,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:33,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:33,447 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:33,449 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:33,449 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:17:33,450 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:33,450 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:33,450 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:33,450 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:17:33,451 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:33,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:33,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:33,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:33,665 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:17:33,665 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-28 23:17:33,711 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 59 states and 75 transitions. Complement of second has 7 states. [2018-11-28 23:17:33,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:17:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:17:33,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-28 23:17:33,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:33,713 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:33,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:33,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:33,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:33,797 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:17:33,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-28 23:17:33,842 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 81 states and 96 transitions. Complement of second has 9 states. [2018-11-28 23:17:33,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:17:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-28 23:17:33,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-28 23:17:33,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:33,845 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:33,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:33,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:33,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:33,926 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 3 loop predicates [2018-11-28 23:17:33,926 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-28 23:17:33,994 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 68 states and 87 transitions. Complement of second has 8 states. [2018-11-28 23:17:33,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:17:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:17:33,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-28 23:17:33,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:34,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-28 23:17:34,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:34,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-28 23:17:34,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:34,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 87 transitions. [2018-11-28 23:17:34,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 23:17:34,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 63 transitions. [2018-11-28 23:17:34,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 23:17:34,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 23:17:34,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2018-11-28 23:17:34,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:34,003 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-28 23:17:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2018-11-28 23:17:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-11-28 23:17:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:17:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-11-28 23:17:34,008 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-28 23:17:34,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:17:34,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:17:34,009 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 4 states. [2018-11-28 23:17:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:34,099 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-28 23:17:34,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:17:34,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2018-11-28 23:17:34,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-28 23:17:34,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 49 transitions. [2018-11-28 23:17:34,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 23:17:34,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:17:34,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2018-11-28 23:17:34,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:34,103 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-11-28 23:17:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2018-11-28 23:17:34,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-28 23:17:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 23:17:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-28 23:17:34,110 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-28 23:17:34,111 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-28 23:17:34,111 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:17:34,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2018-11-28 23:17:34,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-28 23:17:34,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:34,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:34,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2018-11-28 23:17:34,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2018-11-28 23:17:34,112 INFO L794 eck$LassoCheckResult]: Stem: 1606#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1607#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1612#L12 assume !(10 == main_~i~0); 1613#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1615#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1608#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1609#L12 assume !(10 == main_~i~0); 1633#L12-2 assume !(0 == main_~i~0); 1632#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1631#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1621#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1602#L12-2 [2018-11-28 23:17:34,117 INFO L796 eck$LassoCheckResult]: Loop: 1602#L12-2 assume !(0 == main_~i~0); 1603#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1636#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1635#L12 assume !(10 == main_~i~0); 1624#L12-2 assume !(0 == main_~i~0); 1629#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1627#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1622#L12 assume !(10 == main_~i~0); 1625#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1628#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1626#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1619#L12 assume !(10 == main_~i~0); 1617#L12-2 assume !(0 == main_~i~0); 1618#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1630#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1620#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1602#L12-2 [2018-11-28 23:17:34,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash -912841737, now seen corresponding path program 1 times [2018-11-28 23:17:34,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:34,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:34,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:34,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:34,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:34,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:34,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 23:17:34,251 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:34,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1697726743, now seen corresponding path program 1 times [2018-11-28 23:17:34,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:34,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:34,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:34,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:34,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:34,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:34,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:34,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 23:17:34,347 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:17:34,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:17:34,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:17:34,347 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-28 23:17:34,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:34,389 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-28 23:17:34,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:17:34,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2018-11-28 23:17:34,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-28 23:17:34,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 56 transitions. [2018-11-28 23:17:34,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 23:17:34,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 23:17:34,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2018-11-28 23:17:34,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:34,394 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-28 23:17:34,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2018-11-28 23:17:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2018-11-28 23:17:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 23:17:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-11-28 23:17:34,397 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-28 23:17:34,397 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-28 23:17:34,397 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:17:34,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2018-11-28 23:17:34,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-28 23:17:34,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:34,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:34,399 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1] [2018-11-28 23:17:34,399 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2018-11-28 23:17:34,399 INFO L794 eck$LassoCheckResult]: Stem: 1776#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1777#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1793#L12 assume !(10 == main_~i~0); 1794#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1809#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1806#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1807#L12 assume !(10 == main_~i~0); 1813#L12-2 assume !(0 == main_~i~0); 1812#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1780#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1781#L12 assume !(10 == main_~i~0); 1774#L12-2 assume !(0 == main_~i~0); 1775#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1808#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1772#L12-2 [2018-11-28 23:17:34,400 INFO L796 eck$LassoCheckResult]: Loop: 1772#L12-2 assume !(0 == main_~i~0); 1773#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1803#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1801#L12 assume !(10 == main_~i~0); 1792#L12-2 assume !(0 == main_~i~0); 1798#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1795#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1790#L12 assume !(10 == main_~i~0); 1787#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1788#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1779#L12 assume !(10 == main_~i~0); 1814#L12-2 assume !(0 == main_~i~0); 1784#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1785#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1782#L12 assume !(10 == main_~i~0); 1783#L12-2 assume !(0 == main_~i~0); 1789#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1810#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1811#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1772#L12-2 [2018-11-28 23:17:34,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,400 INFO L82 PathProgramCache]: Analyzing trace with hash 554461792, now seen corresponding path program 2 times [2018-11-28 23:17:34,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:34,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:34,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:34,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:34,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:34,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:34,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:17:34,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:17:34,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:34,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:34,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:34,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 23:17:34,484 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:34,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,485 INFO L82 PathProgramCache]: Analyzing trace with hash 104414290, now seen corresponding path program 2 times [2018-11-28 23:17:34,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:34,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:34,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:34,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:34,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:34,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:34,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:17:34,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:17:34,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:34,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:34,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:34,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 23:17:34,592 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:17:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:17:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:17:34,592 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-28 23:17:34,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:34,662 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-28 23:17:34,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:17:34,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 65 transitions. [2018-11-28 23:17:34,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-28 23:17:34,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 64 transitions. [2018-11-28 23:17:34,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 23:17:34,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:17:34,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2018-11-28 23:17:34,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:34,668 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-28 23:17:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2018-11-28 23:17:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-28 23:17:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-28 23:17:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-11-28 23:17:34,671 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-28 23:17:34,671 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-28 23:17:34,671 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:17:34,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2018-11-28 23:17:34,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:17:34,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:34,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:34,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 1, 1, 1] [2018-11-28 23:17:34,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2018-11-28 23:17:34,673 INFO L794 eck$LassoCheckResult]: Stem: 1988#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1989#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1999#L12 assume !(10 == main_~i~0); 2000#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2018#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2015#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2016#L12 assume !(10 == main_~i~0); 2023#L12-2 assume !(0 == main_~i~0); 2024#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2028#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2026#L12 assume !(10 == main_~i~0); 2027#L12-2 assume !(0 == main_~i~0); 1996#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1992#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1993#L12 assume !(10 == main_~i~0); 1986#L12-2 assume !(0 == main_~i~0); 1987#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2019#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2017#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1984#L12-2 [2018-11-28 23:17:34,673 INFO L796 eck$LassoCheckResult]: Loop: 1984#L12-2 assume !(0 == main_~i~0); 1985#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2013#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2011#L12 assume !(10 == main_~i~0); 2003#L12-2 assume !(0 == main_~i~0); 2008#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2006#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2001#L12 assume !(10 == main_~i~0); 1997#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1995#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1990#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1991#L12 assume !(10 == main_~i~0); 1994#L12-2 assume !(0 == main_~i~0); 1998#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2034#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2033#L12 assume !(10 == main_~i~0); 2032#L12-2 assume !(0 == main_~i~0); 2031#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2030#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2029#L12 assume !(10 == main_~i~0); 2025#L12-2 assume !(0 == main_~i~0); 2022#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2021#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1984#L12-2 [2018-11-28 23:17:34,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1774824375, now seen corresponding path program 3 times [2018-11-28 23:17:34,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:34,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:34,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:34,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:34,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:17:34,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-28 23:17:34,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:34,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,749 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:34,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:34,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 23:17:34,769 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:34,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1813717701, now seen corresponding path program 3 times [2018-11-28 23:17:34,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:34,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:34,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:34,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:34,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:34,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:34,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:17:34,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-28 23:17:34,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:34,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:34,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:34,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 23:17:34,874 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:17:34,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:17:34,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:17:34,875 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-28 23:17:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:34,956 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-28 23:17:34,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:17:34,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2018-11-28 23:17:34,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-11-28 23:17:34,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 72 transitions. [2018-11-28 23:17:34,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:17:34,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:17:34,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2018-11-28 23:17:34,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:34,961 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-11-28 23:17:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2018-11-28 23:17:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-11-28 23:17:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-28 23:17:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-11-28 23:17:34,966 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-28 23:17:34,966 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-28 23:17:34,967 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:17:34,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 67 transitions. [2018-11-28 23:17:34,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-11-28 23:17:34,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:34,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:34,968 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1] [2018-11-28 23:17:34,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2018-11-28 23:17:34,969 INFO L794 eck$LassoCheckResult]: Stem: 2242#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2254#L12 assume !(10 == main_~i~0); 2255#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2273#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2270#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2271#L12 assume !(10 == main_~i~0); 2296#L12-2 assume !(0 == main_~i~0); 2295#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2246#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2247#L12 assume !(10 == main_~i~0); 2240#L12-2 assume !(0 == main_~i~0); 2241#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2251#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2294#L12 assume !(10 == main_~i~0); 2293#L12-2 assume !(0 == main_~i~0); 2292#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2275#L12 assume !(10 == main_~i~0); 2280#L12-2 assume !(0 == main_~i~0); 2278#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2272#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2238#L12-2 [2018-11-28 23:17:34,969 INFO L796 eck$LassoCheckResult]: Loop: 2238#L12-2 assume !(0 == main_~i~0); 2239#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2266#L12 assume !(10 == main_~i~0); 2258#L12-2 assume !(0 == main_~i~0); 2263#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2261#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2256#L12 assume !(10 == main_~i~0); 2252#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2253#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2244#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2245#L12 assume !(10 == main_~i~0); 2248#L12-2 assume !(0 == main_~i~0); 2249#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2250#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2290#L12 assume !(10 == main_~i~0); 2289#L12-2 assume !(0 == main_~i~0); 2288#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2286#L12 assume !(10 == main_~i~0); 2285#L12-2 assume !(0 == main_~i~0); 2284#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2282#L12 assume !(10 == main_~i~0); 2281#L12-2 assume !(0 == main_~i~0); 2279#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2276#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2277#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2238#L12-2 [2018-11-28 23:17:34,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,969 INFO L82 PathProgramCache]: Analyzing trace with hash 790045106, now seen corresponding path program 4 times [2018-11-28 23:17:34,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:34,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:34,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:34,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:35,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:35,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:35,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:17:35,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:17:35,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:35,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:35,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:35,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 23:17:35,108 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:35,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:35,108 INFO L82 PathProgramCache]: Analyzing trace with hash 798220708, now seen corresponding path program 4 times [2018-11-28 23:17:35,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:35,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:35,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:35,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:35,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:35,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:35,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:35,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:17:35,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:17:35,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:35,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:35,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:35,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 23:17:35,265 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:17:35,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:17:35,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:17:35,265 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-28 23:17:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:35,329 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-11-28 23:17:35,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:17:35,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 81 transitions. [2018-11-28 23:17:35,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-28 23:17:35,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 80 transitions. [2018-11-28 23:17:35,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-28 23:17:35,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-28 23:17:35,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2018-11-28 23:17:35,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:35,334 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-11-28 23:17:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2018-11-28 23:17:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-11-28 23:17:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 23:17:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-11-28 23:17:35,340 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-28 23:17:35,340 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-28 23:17:35,340 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 23:17:35,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 75 transitions. [2018-11-28 23:17:35,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-28 23:17:35,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:35,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:35,347 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2018-11-28 23:17:35,347 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2018-11-28 23:17:35,347 INFO L794 eck$LassoCheckResult]: Stem: 2538#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2539#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2550#L12 assume !(10 == main_~i~0); 2551#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2569#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2566#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2567#L12 assume !(10 == main_~i~0); 2600#L12-2 assume !(0 == main_~i~0); 2599#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2542#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2543#L12 assume !(10 == main_~i~0); 2536#L12-2 assume !(0 == main_~i~0); 2537#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2547#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2598#L12 assume !(10 == main_~i~0); 2597#L12-2 assume !(0 == main_~i~0); 2596#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2595#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2594#L12 assume !(10 == main_~i~0); 2593#L12-2 assume !(0 == main_~i~0); 2592#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2591#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2573#L12 assume !(10 == main_~i~0); 2577#L12-2 assume !(0 == main_~i~0); 2575#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2572#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2568#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2534#L12-2 [2018-11-28 23:17:35,347 INFO L796 eck$LassoCheckResult]: Loop: 2534#L12-2 assume !(0 == main_~i~0); 2535#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2564#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2562#L12 assume !(10 == main_~i~0); 2554#L12-2 assume !(0 == main_~i~0); 2559#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2557#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2552#L12 assume !(10 == main_~i~0); 2548#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2549#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2540#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2541#L12 assume !(10 == main_~i~0); 2544#L12-2 assume !(0 == main_~i~0); 2545#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2546#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2590#L12 assume !(10 == main_~i~0); 2589#L12-2 assume !(0 == main_~i~0); 2588#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2587#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2586#L12 assume !(10 == main_~i~0); 2585#L12-2 assume !(0 == main_~i~0); 2584#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2583#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2582#L12 assume !(10 == main_~i~0); 2581#L12-2 assume !(0 == main_~i~0); 2580#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2579#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2578#L12 assume !(10 == main_~i~0); 2576#L12-2 assume !(0 == main_~i~0); 2574#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2570#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2571#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2534#L12-2 [2018-11-28 23:17:35,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:35,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1500441957, now seen corresponding path program 5 times [2018-11-28 23:17:35,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:35,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:35,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:35,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:35,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:35,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:35,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:35,567 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:17:35,577 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-28 23:17:35,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:35,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:35,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:35,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 23:17:35,607 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:35,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1712813683, now seen corresponding path program 5 times [2018-11-28 23:17:35,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:35,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:35,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:35,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:35,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:35,722 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:17:35,840 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-28 23:17:35,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:35,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:35,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:35,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 23:17:35,886 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:17:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:17:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:17:35,887 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-11-28 23:17:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:36,072 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-28 23:17:36,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:17:36,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2018-11-28 23:17:36,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-28 23:17:36,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 88 transitions. [2018-11-28 23:17:36,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-28 23:17:36,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-28 23:17:36,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 88 transitions. [2018-11-28 23:17:36,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:36,077 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-11-28 23:17:36,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 88 transitions. [2018-11-28 23:17:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-11-28 23:17:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 23:17:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-11-28 23:17:36,081 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-11-28 23:17:36,081 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-11-28 23:17:36,081 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 23:17:36,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 83 transitions. [2018-11-28 23:17:36,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-28 23:17:36,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:36,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:36,087 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 6, 1, 1, 1] [2018-11-28 23:17:36,087 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2018-11-28 23:17:36,087 INFO L794 eck$LassoCheckResult]: Stem: 2876#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2877#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2892#L12 assume !(10 == main_~i~0); 2893#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2908#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2905#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2906#L12 assume !(10 == main_~i~0); 2946#L12-2 assume !(0 == main_~i~0); 2945#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2880#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2881#L12 assume !(10 == main_~i~0); 2874#L12-2 assume !(0 == main_~i~0); 2875#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2885#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2944#L12 assume !(10 == main_~i~0); 2943#L12-2 assume !(0 == main_~i~0); 2942#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2941#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2940#L12 assume !(10 == main_~i~0); 2939#L12-2 assume !(0 == main_~i~0); 2938#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2937#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2936#L12 assume !(10 == main_~i~0); 2935#L12-2 assume !(0 == main_~i~0); 2934#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2933#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2912#L12 assume !(10 == main_~i~0); 2916#L12-2 assume !(0 == main_~i~0); 2914#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2911#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2907#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2872#L12-2 [2018-11-28 23:17:36,088 INFO L796 eck$LassoCheckResult]: Loop: 2872#L12-2 assume !(0 == main_~i~0); 2873#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2900#L12 assume !(10 == main_~i~0); 2891#L12-2 assume !(0 == main_~i~0); 2897#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2894#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2889#L12 assume !(10 == main_~i~0); 2886#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2883#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2884#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2932#L12 assume !(10 == main_~i~0); 2887#L12-2 assume !(0 == main_~i~0); 2888#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2878#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2879#L12 assume !(10 == main_~i~0); 2882#L12-2 assume !(0 == main_~i~0); 2931#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2930#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2929#L12 assume !(10 == main_~i~0); 2928#L12-2 assume !(0 == main_~i~0); 2927#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2926#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2925#L12 assume !(10 == main_~i~0); 2924#L12-2 assume !(0 == main_~i~0); 2923#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2922#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2921#L12 assume !(10 == main_~i~0); 2920#L12-2 assume !(0 == main_~i~0); 2919#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2918#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2917#L12 assume !(10 == main_~i~0); 2915#L12-2 assume !(0 == main_~i~0); 2913#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2909#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2910#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2872#L12-2 [2018-11-28 23:17:36,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:36,088 INFO L82 PathProgramCache]: Analyzing trace with hash -60397820, now seen corresponding path program 6 times [2018-11-28 23:17:36,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:36,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:36,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:36,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:36,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:36,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:36,271 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:17:36,307 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-28 23:17:36,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:36,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:36,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:36,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-28 23:17:36,347 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:36,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:36,348 INFO L82 PathProgramCache]: Analyzing trace with hash -127593226, now seen corresponding path program 6 times [2018-11-28 23:17:36,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:36,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:36,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:36,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:36,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:36,472 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:17:36,503 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-28 23:17:36,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:36,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:36,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:36,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-28 23:17:36,539 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:17:36,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:17:36,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:17:36,540 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. cyclomatic complexity: 11 Second operand 10 states. [2018-11-28 23:17:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:36,728 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-28 23:17:36,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:17:36,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 97 transitions. [2018-11-28 23:17:36,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-28 23:17:36,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 88 states and 96 transitions. [2018-11-28 23:17:36,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-28 23:17:36,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-28 23:17:36,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 96 transitions. [2018-11-28 23:17:36,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:36,736 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-11-28 23:17:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 96 transitions. [2018-11-28 23:17:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2018-11-28 23:17:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 23:17:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-11-28 23:17:36,742 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-11-28 23:17:36,742 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-11-28 23:17:36,742 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 23:17:36,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 91 transitions. [2018-11-28 23:17:36,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-11-28 23:17:36,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:36,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:36,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 1, 1, 1] [2018-11-28 23:17:36,750 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2018-11-28 23:17:36,750 INFO L794 eck$LassoCheckResult]: Stem: 3256#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3257#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3272#L12 assume !(10 == main_~i~0); 3273#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3287#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3285#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3263#L12 assume !(10 == main_~i~0); 3254#L12-2 assume !(0 == main_~i~0); 3255#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3261#L12 assume !(10 == main_~i~0); 3334#L12-2 assume !(0 == main_~i~0); 3333#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3332#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3331#L12 assume !(10 == main_~i~0); 3330#L12-2 assume !(0 == main_~i~0); 3329#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3327#L12 assume !(10 == main_~i~0); 3326#L12-2 assume !(0 == main_~i~0); 3325#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3324#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3323#L12 assume !(10 == main_~i~0); 3322#L12-2 assume !(0 == main_~i~0); 3321#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3320#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3319#L12 assume !(10 == main_~i~0); 3318#L12-2 assume !(0 == main_~i~0); 3317#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3316#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3291#L12 assume !(10 == main_~i~0); 3295#L12-2 assume !(0 == main_~i~0); 3293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3290#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3286#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3252#L12-2 [2018-11-28 23:17:36,750 INFO L796 eck$LassoCheckResult]: Loop: 3252#L12-2 assume !(0 == main_~i~0); 3253#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3282#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3280#L12 assume !(10 == main_~i~0); 3271#L12-2 assume !(0 == main_~i~0); 3277#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3269#L12 assume !(10 == main_~i~0); 3266#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3264#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3265#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3315#L12 assume !(10 == main_~i~0); 3267#L12-2 assume !(0 == main_~i~0); 3268#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3258#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3259#L12 assume !(10 == main_~i~0); 3262#L12-2 assume !(0 == main_~i~0); 3314#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3312#L12 assume !(10 == main_~i~0); 3311#L12-2 assume !(0 == main_~i~0); 3310#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3308#L12 assume !(10 == main_~i~0); 3307#L12-2 assume !(0 == main_~i~0); 3306#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3304#L12 assume !(10 == main_~i~0); 3303#L12-2 assume !(0 == main_~i~0); 3302#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3300#L12 assume !(10 == main_~i~0); 3299#L12-2 assume !(0 == main_~i~0); 3298#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3296#L12 assume !(10 == main_~i~0); 3294#L12-2 assume !(0 == main_~i~0); 3292#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3288#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3289#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3252#L12-2 [2018-11-28 23:17:36,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:36,751 INFO L82 PathProgramCache]: Analyzing trace with hash 87645933, now seen corresponding path program 7 times [2018-11-28 23:17:36,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:36,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:36,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:36,971 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:36,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:36,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:36,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:36,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:37,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:37,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-28 23:17:37,033 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:37,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:37,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1701561311, now seen corresponding path program 7 times [2018-11-28 23:17:37,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:37,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:37,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:37,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:37,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:37,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:37,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:37,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:37,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:37,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:37,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-28 23:17:37,870 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:17:37,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:17:37,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:17:37,871 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-11-28 23:17:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:37,943 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-11-28 23:17:37,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:17:37,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 105 transitions. [2018-11-28 23:17:37,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-11-28 23:17:37,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 96 states and 104 transitions. [2018-11-28 23:17:37,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-28 23:17:37,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-28 23:17:37,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 104 transitions. [2018-11-28 23:17:37,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:37,947 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-11-28 23:17:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 104 transitions. [2018-11-28 23:17:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-11-28 23:17:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 23:17:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-11-28 23:17:37,950 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-11-28 23:17:37,950 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-11-28 23:17:37,950 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 23:17:37,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 99 transitions. [2018-11-28 23:17:37,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-11-28 23:17:37,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:37,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:37,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 1, 1, 1] [2018-11-28 23:17:37,952 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2018-11-28 23:17:37,952 INFO L794 eck$LassoCheckResult]: Stem: 3678#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3679#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3693#L12 assume !(10 == main_~i~0); 3694#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3708#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3706#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3685#L12 assume !(10 == main_~i~0); 3676#L12-2 assume !(0 == main_~i~0); 3677#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3682#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3683#L12 assume !(10 == main_~i~0); 3764#L12-2 assume !(0 == main_~i~0); 3763#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3761#L12 assume !(10 == main_~i~0); 3760#L12-2 assume !(0 == main_~i~0); 3759#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3758#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3757#L12 assume !(10 == main_~i~0); 3756#L12-2 assume !(0 == main_~i~0); 3755#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3754#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3753#L12 assume !(10 == main_~i~0); 3752#L12-2 assume !(0 == main_~i~0); 3751#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3750#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3749#L12 assume !(10 == main_~i~0); 3748#L12-2 assume !(0 == main_~i~0); 3747#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3746#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3745#L12 assume !(10 == main_~i~0); 3744#L12-2 assume !(0 == main_~i~0); 3743#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3742#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3710#L12 assume !(10 == main_~i~0); 3715#L12-2 assume !(0 == main_~i~0); 3713#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3707#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3674#L12-2 [2018-11-28 23:17:37,952 INFO L796 eck$LassoCheckResult]: Loop: 3674#L12-2 assume !(0 == main_~i~0); 3675#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3703#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3701#L12 assume !(10 == main_~i~0); 3692#L12-2 assume !(0 == main_~i~0); 3698#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3695#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3690#L12 assume !(10 == main_~i~0); 3688#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3689#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3680#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3681#L12 assume !(10 == main_~i~0); 3684#L12-2 assume !(0 == main_~i~0); 3686#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3687#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3741#L12 assume !(10 == main_~i~0); 3740#L12-2 assume !(0 == main_~i~0); 3739#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3738#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3737#L12 assume !(10 == main_~i~0); 3736#L12-2 assume !(0 == main_~i~0); 3735#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3734#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3733#L12 assume !(10 == main_~i~0); 3732#L12-2 assume !(0 == main_~i~0); 3731#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3730#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3729#L12 assume !(10 == main_~i~0); 3728#L12-2 assume !(0 == main_~i~0); 3727#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3726#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3725#L12 assume !(10 == main_~i~0); 3724#L12-2 assume !(0 == main_~i~0); 3723#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3722#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3721#L12 assume !(10 == main_~i~0); 3720#L12-2 assume !(0 == main_~i~0); 3719#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3718#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3717#L12 assume !(10 == main_~i~0); 3716#L12-2 assume !(0 == main_~i~0); 3714#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3711#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3712#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3674#L12-2 [2018-11-28 23:17:37,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:37,953 INFO L82 PathProgramCache]: Analyzing trace with hash -91473322, now seen corresponding path program 8 times [2018-11-28 23:17:37,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:37,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:37,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:37,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:37,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:38,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:38,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:38,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:17:38,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:17:38,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:38,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:38,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:38,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-28 23:17:38,259 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:38,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2143365560, now seen corresponding path program 8 times [2018-11-28 23:17:38,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:38,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:38,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:38,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:38,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:38,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:38,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:17:38,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:17:38,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:38,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:17:38,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:38,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-28 23:17:38,423 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:17:38,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:17:38,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:17:38,424 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. cyclomatic complexity: 11 Second operand 12 states. [2018-11-28 23:17:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:38,498 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-11-28 23:17:38,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:17:38,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 113 transitions. [2018-11-28 23:17:38,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-28 23:17:38,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 104 states and 112 transitions. [2018-11-28 23:17:38,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-28 23:17:38,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-28 23:17:38,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 112 transitions. [2018-11-28 23:17:38,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:38,505 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-11-28 23:17:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 112 transitions. [2018-11-28 23:17:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-11-28 23:17:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 23:17:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-11-28 23:17:38,510 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-11-28 23:17:38,510 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-11-28 23:17:38,510 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 23:17:38,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 107 transitions. [2018-11-28 23:17:38,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2018-11-28 23:17:38,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:38,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:38,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-28 23:17:38,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2018-11-28 23:17:38,516 INFO L794 eck$LassoCheckResult]: Stem: 4142#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 4143#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4154#L12 assume !(10 == main_~i~0); 4155#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4172#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4170#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4149#L12 assume !(10 == main_~i~0); 4140#L12-2 assume !(0 == main_~i~0); 4141#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4146#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4147#L12 assume !(10 == main_~i~0); 4236#L12-2 assume !(0 == main_~i~0); 4235#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4234#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4233#L12 assume !(10 == main_~i~0); 4232#L12-2 assume !(0 == main_~i~0); 4231#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4230#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4229#L12 assume !(10 == main_~i~0); 4228#L12-2 assume !(0 == main_~i~0); 4227#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4226#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4225#L12 assume !(10 == main_~i~0); 4224#L12-2 assume !(0 == main_~i~0); 4223#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4222#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4221#L12 assume !(10 == main_~i~0); 4220#L12-2 assume !(0 == main_~i~0); 4219#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4218#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4217#L12 assume !(10 == main_~i~0); 4216#L12-2 assume !(0 == main_~i~0); 4215#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4214#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4213#L12 assume !(10 == main_~i~0); 4212#L12-2 assume !(0 == main_~i~0); 4211#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4210#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4174#L12 assume !(10 == main_~i~0); 4179#L12-2 assume !(0 == main_~i~0); 4177#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4173#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4171#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4138#L12-2 [2018-11-28 23:17:38,516 INFO L796 eck$LassoCheckResult]: Loop: 4138#L12-2 assume !(0 == main_~i~0); 4139#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4168#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4166#L12 assume !(10 == main_~i~0); 4158#L12-2 assume !(0 == main_~i~0); 4163#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4161#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4156#L12 assume !(10 == main_~i~0); 4152#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4153#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4144#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4145#L12 assume !(10 == main_~i~0); 4148#L12-2 assume !(0 == main_~i~0); 4150#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4151#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4209#L12 assume !(10 == main_~i~0); 4208#L12-2 assume !(0 == main_~i~0); 4207#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4206#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4205#L12 assume !(10 == main_~i~0); 4204#L12-2 assume !(0 == main_~i~0); 4203#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4202#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4201#L12 assume !(10 == main_~i~0); 4200#L12-2 assume !(0 == main_~i~0); 4199#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4198#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4197#L12 assume !(10 == main_~i~0); 4196#L12-2 assume !(0 == main_~i~0); 4195#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4194#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4193#L12 assume !(10 == main_~i~0); 4192#L12-2 assume !(0 == main_~i~0); 4191#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4190#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4189#L12 assume !(10 == main_~i~0); 4188#L12-2 assume !(0 == main_~i~0); 4187#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4186#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4185#L12 assume !(10 == main_~i~0); 4184#L12-2 assume !(0 == main_~i~0); 4183#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4182#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4181#L12 assume !(10 == main_~i~0); 4180#L12-2 assume !(0 == main_~i~0); 4178#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4175#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4176#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4138#L12-2 [2018-11-28 23:17:38,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:38,516 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 9 times [2018-11-28 23:17:38,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:38,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:38,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:38,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:38,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:38,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash -50295759, now seen corresponding path program 9 times [2018-11-28 23:17:38,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:38,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:38,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:38,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:38,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:38,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:38,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1470164625, now seen corresponding path program 2 times [2018-11-28 23:17:38,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:38,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:38,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:38,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:38,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 591 proven. 6 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:38,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:38,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:38,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:17:38,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:17:38,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:38,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 591 proven. 6 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:38,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:38,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 23:17:39,048 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 57 [2018-11-28 23:17:39,066 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:39,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:39,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:39,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:39,067 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:39,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:39,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:39,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:39,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration17_Loop [2018-11-28 23:17:39,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:39,068 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:39,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:39,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:39,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:39,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:39,369 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 11 [2018-11-28 23:17:39,436 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:39,437 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:39,443 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:39,443 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:39,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:39,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:39,494 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:39,495 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:39,495 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:39,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:39,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:39,496 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:39,496 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:39,496 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:39,496 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:39,496 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration17_Loop [2018-11-28 23:17:39,496 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:39,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:39,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:39,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:39,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:39,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:39,608 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:39,608 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:39,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:39,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:39,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:39,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:39,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:39,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:39,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:39,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:39,615 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:39,622 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:39,625 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:39,625 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:39,625 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:39,628 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:39,628 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 6 Supporting invariants [] [2018-11-28 23:17:39,628 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:39,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:39,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:39,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-28 23:17:39,733 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:17:39,733 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 107 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-28 23:17:39,900 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 107 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 367 states and 394 transitions. Complement of second has 15 states. [2018-11-28 23:17:39,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:17:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-28 23:17:39,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 48 letters. [2018-11-28 23:17:39,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:39,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 91 letters. Loop has 48 letters. [2018-11-28 23:17:39,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:39,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 96 letters. [2018-11-28 23:17:39,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:39,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 367 states and 394 transitions. [2018-11-28 23:17:39,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-11-28 23:17:39,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 367 states to 330 states and 354 transitions. [2018-11-28 23:17:39,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-11-28 23:17:39,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-28 23:17:39,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 354 transitions. [2018-11-28 23:17:39,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:39,920 INFO L705 BuchiCegarLoop]: Abstraction has 330 states and 354 transitions. [2018-11-28 23:17:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 354 transitions. [2018-11-28 23:17:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 306. [2018-11-28 23:17:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-11-28 23:17:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 327 transitions. [2018-11-28 23:17:39,928 INFO L728 BuchiCegarLoop]: Abstraction has 306 states and 327 transitions. [2018-11-28 23:17:39,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:17:39,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:17:39,930 INFO L87 Difference]: Start difference. First operand 306 states and 327 transitions. Second operand 5 states. [2018-11-28 23:17:39,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:39,977 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2018-11-28 23:17:39,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:17:39,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 208 transitions. [2018-11-28 23:17:39,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2018-11-28 23:17:39,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 172 states and 189 transitions. [2018-11-28 23:17:39,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-28 23:17:39,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-28 23:17:39,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 189 transitions. [2018-11-28 23:17:39,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:39,982 INFO L705 BuchiCegarLoop]: Abstraction has 172 states and 189 transitions. [2018-11-28 23:17:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 189 transitions. [2018-11-28 23:17:39,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 107. [2018-11-28 23:17:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 23:17:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-11-28 23:17:39,990 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-11-28 23:17:39,990 INFO L608 BuchiCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-11-28 23:17:39,990 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-28 23:17:39,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 117 transitions. [2018-11-28 23:17:39,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2018-11-28 23:17:39,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:39,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:39,995 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-28 23:17:39,995 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] [2018-11-28 23:17:39,998 INFO L794 eck$LassoCheckResult]: Stem: 5692#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5693#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5704#L12 assume !(10 == main_~i~0); 5702#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 5701#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5694#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5695#L12 assume !(10 == main_~i~0); 5792#L12-2 assume !(0 == main_~i~0); 5791#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5790#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5789#L12 assume !(10 == main_~i~0); 5788#L12-2 assume !(0 == main_~i~0); 5787#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5785#L12 assume !(10 == main_~i~0); 5784#L12-2 assume !(0 == main_~i~0); 5783#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5782#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5781#L12 assume !(10 == main_~i~0); 5780#L12-2 assume !(0 == main_~i~0); 5779#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5777#L12 assume !(10 == main_~i~0); 5776#L12-2 assume !(0 == main_~i~0); 5775#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5774#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5773#L12 assume !(10 == main_~i~0); 5772#L12-2 assume !(0 == main_~i~0); 5771#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5769#L12 assume !(10 == main_~i~0); 5768#L12-2 assume !(0 == main_~i~0); 5767#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5766#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5765#L12 assume !(10 == main_~i~0); 5764#L12-2 assume !(0 == main_~i~0); 5763#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5722#L12 assume !(10 == main_~i~0); 5760#L12-2 assume !(0 == main_~i~0); 5759#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5721#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5711#L12 assume 10 == main_~i~0;main_~up~0 := 0; 5688#L12-2 [2018-11-28 23:17:39,998 INFO L796 eck$LassoCheckResult]: Loop: 5688#L12-2 assume !(0 == main_~i~0); 5689#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5720#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5719#L12 assume !(10 == main_~i~0); 5718#L12-2 assume !(0 == main_~i~0); 5717#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5716#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5715#L12 assume !(10 == main_~i~0); 5708#L12-2 assume !(0 == main_~i~0); 5710#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5705#L12 assume !(10 == main_~i~0); 5707#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 5758#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5756#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5698#L12 assume !(10 == main_~i~0); 5699#L12-2 assume !(0 == main_~i~0); 5703#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5755#L12 assume !(10 == main_~i~0); 5754#L12-2 assume !(0 == main_~i~0); 5753#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5752#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5751#L12 assume !(10 == main_~i~0); 5750#L12-2 assume !(0 == main_~i~0); 5749#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5748#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5747#L12 assume !(10 == main_~i~0); 5746#L12-2 assume !(0 == main_~i~0); 5745#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5744#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5743#L12 assume !(10 == main_~i~0); 5742#L12-2 assume !(0 == main_~i~0); 5741#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5740#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5739#L12 assume !(10 == main_~i~0); 5738#L12-2 assume !(0 == main_~i~0); 5737#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5736#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5735#L12 assume !(10 == main_~i~0); 5734#L12-2 assume !(0 == main_~i~0); 5733#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5732#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5731#L12 assume !(10 == main_~i~0); 5730#L12-2 assume !(0 == main_~i~0); 5729#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5728#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5727#L12 assume !(10 == main_~i~0); 5726#L12-2 assume !(0 == main_~i~0); 5725#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5723#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5724#L12 assume 10 == main_~i~0;main_~up~0 := 0; 5688#L12-2 [2018-11-28 23:17:39,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:39,998 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 10 times [2018-11-28 23:17:39,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:39,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:39,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:40,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:40,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:40,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:40,020 INFO L82 PathProgramCache]: Analyzing trace with hash -690818020, now seen corresponding path program 10 times [2018-11-28 23:17:40,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:40,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:40,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:40,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:40,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:40,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash -120542630, now seen corresponding path program 3 times [2018-11-28 23:17:40,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:40,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:40,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:40,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:40,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:40,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:17:40,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-28 23:17:40,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:40,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:40,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:40,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 23:17:40,657 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 52 [2018-11-28 23:17:40,667 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:40,667 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:40,668 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:40,668 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:40,668 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:40,668 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:40,668 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:40,668 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:40,669 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration18_Loop [2018-11-28 23:17:40,669 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:40,669 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:40,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:40,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:40,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:40,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:40,753 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:40,753 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:40,760 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:40,760 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:40,780 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:40,780 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:40,784 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:40,785 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:40,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:40,808 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:40,812 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:40,829 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:40,829 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:40,829 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:40,829 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:40,830 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:40,830 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:40,830 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:40,830 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:40,830 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration18_Loop [2018-11-28 23:17:40,830 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:40,830 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:40,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:40,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:40,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:40,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:40,920 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:40,920 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:40,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:40,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:40,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:40,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:40,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:40,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:40,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:40,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:40,925 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:40,926 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:40,926 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:40,932 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:40,932 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:40,932 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:40,932 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 Supporting invariants [] [2018-11-28 23:17:40,933 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:40,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:40,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:40,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-28 23:17:41,211 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:17:41,211 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 117 transitions. cyclomatic complexity: 13 Second operand 7 states. [2018-11-28 23:17:41,964 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 117 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 431 states and 470 transitions. Complement of second has 19 states. [2018-11-28 23:17:41,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:17:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2018-11-28 23:17:41,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 52 letters. [2018-11-28 23:17:41,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:41,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 95 letters. Loop has 52 letters. [2018-11-28 23:17:41,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:41,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 104 letters. [2018-11-28 23:17:41,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:41,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 470 transitions. [2018-11-28 23:17:41,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2018-11-28 23:17:41,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 366 states and 398 transitions. [2018-11-28 23:17:41,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2018-11-28 23:17:41,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-28 23:17:41,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 398 transitions. [2018-11-28 23:17:41,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:41,982 INFO L705 BuchiCegarLoop]: Abstraction has 366 states and 398 transitions. [2018-11-28 23:17:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 398 transitions. [2018-11-28 23:17:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 314. [2018-11-28 23:17:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-28 23:17:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 337 transitions. [2018-11-28 23:17:41,996 INFO L728 BuchiCegarLoop]: Abstraction has 314 states and 337 transitions. [2018-11-28 23:17:41,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:17:41,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:17:41,996 INFO L87 Difference]: Start difference. First operand 314 states and 337 transitions. Second operand 6 states. [2018-11-28 23:17:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:42,060 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2018-11-28 23:17:42,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:17:42,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 236 transitions. [2018-11-28 23:17:42,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-28 23:17:42,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 188 states and 209 transitions. [2018-11-28 23:17:42,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-28 23:17:42,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-28 23:17:42,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 209 transitions. [2018-11-28 23:17:42,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:42,066 INFO L705 BuchiCegarLoop]: Abstraction has 188 states and 209 transitions. [2018-11-28 23:17:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 209 transitions. [2018-11-28 23:17:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 115. [2018-11-28 23:17:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-28 23:17:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-11-28 23:17:42,069 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-11-28 23:17:42,069 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-11-28 23:17:42,069 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-28 23:17:42,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 127 transitions. [2018-11-28 23:17:42,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2018-11-28 23:17:42,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:42,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:42,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-28 23:17:42,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2018-11-28 23:17:42,072 INFO L794 eck$LassoCheckResult]: Stem: 7379#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 7380#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7395#L12 assume !(10 == main_~i~0); 7389#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 7388#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7381#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7382#L12 assume !(10 == main_~i~0); 7483#L12-2 assume !(0 == main_~i~0); 7482#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7481#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7480#L12 assume !(10 == main_~i~0); 7479#L12-2 assume !(0 == main_~i~0); 7478#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7477#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7476#L12 assume !(10 == main_~i~0); 7475#L12-2 assume !(0 == main_~i~0); 7474#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7473#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7472#L12 assume !(10 == main_~i~0); 7471#L12-2 assume !(0 == main_~i~0); 7470#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7469#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7468#L12 assume !(10 == main_~i~0); 7467#L12-2 assume !(0 == main_~i~0); 7466#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7465#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7464#L12 assume !(10 == main_~i~0); 7463#L12-2 assume !(0 == main_~i~0); 7462#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7461#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7460#L12 assume !(10 == main_~i~0); 7459#L12-2 assume !(0 == main_~i~0); 7458#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7457#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7456#L12 assume !(10 == main_~i~0); 7455#L12-2 assume !(0 == main_~i~0); 7454#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7453#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7413#L12 assume !(10 == main_~i~0); 7451#L12-2 assume !(0 == main_~i~0); 7450#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7398#L12 assume 10 == main_~i~0;main_~up~0 := 0; 7375#L12-2 [2018-11-28 23:17:42,072 INFO L796 eck$LassoCheckResult]: Loop: 7375#L12-2 assume !(0 == main_~i~0); 7376#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7410#L12 assume !(10 == main_~i~0); 7409#L12-2 assume !(0 == main_~i~0); 7408#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7407#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7406#L12 assume !(10 == main_~i~0); 7405#L12-2 assume !(0 == main_~i~0); 7404#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7403#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7402#L12 assume !(10 == main_~i~0); 7394#L12-2 assume !(0 == main_~i~0); 7397#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7396#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7391#L12 assume !(10 == main_~i~0); 7393#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 7449#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7447#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7385#L12 assume !(10 == main_~i~0); 7386#L12-2 assume !(0 == main_~i~0); 7390#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7448#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7446#L12 assume !(10 == main_~i~0); 7445#L12-2 assume !(0 == main_~i~0); 7444#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7443#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7442#L12 assume !(10 == main_~i~0); 7441#L12-2 assume !(0 == main_~i~0); 7440#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7439#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7438#L12 assume !(10 == main_~i~0); 7437#L12-2 assume !(0 == main_~i~0); 7436#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7435#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7434#L12 assume !(10 == main_~i~0); 7433#L12-2 assume !(0 == main_~i~0); 7432#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7430#L12 assume !(10 == main_~i~0); 7429#L12-2 assume !(0 == main_~i~0); 7428#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7427#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7426#L12 assume !(10 == main_~i~0); 7425#L12-2 assume !(0 == main_~i~0); 7424#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7423#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7422#L12 assume !(10 == main_~i~0); 7421#L12-2 assume !(0 == main_~i~0); 7420#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7419#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7418#L12 assume !(10 == main_~i~0); 7417#L12-2 assume !(0 == main_~i~0); 7416#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7414#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7415#L12 assume 10 == main_~i~0;main_~up~0 := 0; 7375#L12-2 [2018-11-28 23:17:42,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:42,072 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 11 times [2018-11-28 23:17:42,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:42,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:42,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:42,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:42,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:42,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:42,085 INFO L82 PathProgramCache]: Analyzing trace with hash 805924487, now seen corresponding path program 11 times [2018-11-28 23:17:42,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:42,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:42,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:42,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:42,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:42,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:42,098 INFO L82 PathProgramCache]: Analyzing trace with hash 329635269, now seen corresponding path program 4 times [2018-11-28 23:17:42,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:42,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:42,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:42,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:42,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:42,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:42,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:42,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:42,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:17:42,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:17:42,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:42,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:42,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:42,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 23:17:42,606 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 61 [2018-11-28 23:17:42,623 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:42,623 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:42,623 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:42,623 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:42,624 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:42,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:42,624 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:42,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:42,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration19_Loop [2018-11-28 23:17:42,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:42,624 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:42,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,737 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:42,737 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:42,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:42,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:42,763 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:42,764 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:42,767 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:42,768 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:42,772 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:42,773 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:42,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:42,793 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:42,813 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:42,813 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:42,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:42,818 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:42,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:42,841 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:42,865 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:42,866 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:42,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:42,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:42,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:42,867 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:42,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:42,868 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:42,868 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:42,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration19_Loop [2018-11-28 23:17:42,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:42,868 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:42,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,981 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:42,983 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:42,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:42,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:42,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:42,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:42,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:42,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:42,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:42,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:42,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:42,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:42,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:42,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:42,990 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:17:42,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:42,990 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:17:42,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:42,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:43,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:43,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:43,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:43,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:43,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:43,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:43,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:43,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:43,007 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:43,012 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:43,013 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:43,013 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:43,013 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:43,013 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:43,013 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2018-11-28 23:17:43,014 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:43,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:43,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:43,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-28 23:17:43,177 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 23:17:43,177 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 127 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-11-28 23:17:43,400 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 127 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 511 states and 566 transitions. Complement of second has 23 states. [2018-11-28 23:17:43,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:17:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2018-11-28 23:17:43,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 56 letters. [2018-11-28 23:17:43,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:43,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 99 letters. Loop has 56 letters. [2018-11-28 23:17:43,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:43,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 112 letters. [2018-11-28 23:17:43,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:43,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 566 transitions. [2018-11-28 23:17:43,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-11-28 23:17:43,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 410 states and 452 transitions. [2018-11-28 23:17:43,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2018-11-28 23:17:43,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-28 23:17:43,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 410 states and 452 transitions. [2018-11-28 23:17:43,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:43,418 INFO L705 BuchiCegarLoop]: Abstraction has 410 states and 452 transitions. [2018-11-28 23:17:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states and 452 transitions. [2018-11-28 23:17:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 322. [2018-11-28 23:17:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-11-28 23:17:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 347 transitions. [2018-11-28 23:17:43,427 INFO L728 BuchiCegarLoop]: Abstraction has 322 states and 347 transitions. [2018-11-28 23:17:43,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:17:43,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:17:43,432 INFO L87 Difference]: Start difference. First operand 322 states and 347 transitions. Second operand 7 states. [2018-11-28 23:17:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:43,490 INFO L93 Difference]: Finished difference Result 239 states and 264 transitions. [2018-11-28 23:17:43,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:17:43,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 264 transitions. [2018-11-28 23:17:43,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-28 23:17:43,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 204 states and 229 transitions. [2018-11-28 23:17:43,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-28 23:17:43,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-28 23:17:43,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 229 transitions. [2018-11-28 23:17:43,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:43,497 INFO L705 BuchiCegarLoop]: Abstraction has 204 states and 229 transitions. [2018-11-28 23:17:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 229 transitions. [2018-11-28 23:17:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 123. [2018-11-28 23:17:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-28 23:17:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2018-11-28 23:17:43,504 INFO L728 BuchiCegarLoop]: Abstraction has 123 states and 137 transitions. [2018-11-28 23:17:43,504 INFO L608 BuchiCegarLoop]: Abstraction has 123 states and 137 transitions. [2018-11-28 23:17:43,504 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-28 23:17:43,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 137 transitions. [2018-11-28 23:17:43,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-11-28 23:17:43,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:43,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:43,509 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-28 23:17:43,509 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] [2018-11-28 23:17:43,509 INFO L794 eck$LassoCheckResult]: Stem: 9219#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 9220#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9235#L12 assume !(10 == main_~i~0); 9229#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 9228#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9221#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9222#L12 assume !(10 == main_~i~0); 9327#L12-2 assume !(0 == main_~i~0); 9326#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9324#L12 assume !(10 == main_~i~0); 9323#L12-2 assume !(0 == main_~i~0); 9322#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9321#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9320#L12 assume !(10 == main_~i~0); 9319#L12-2 assume !(0 == main_~i~0); 9318#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9316#L12 assume !(10 == main_~i~0); 9315#L12-2 assume !(0 == main_~i~0); 9314#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9312#L12 assume !(10 == main_~i~0); 9311#L12-2 assume !(0 == main_~i~0); 9310#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9308#L12 assume !(10 == main_~i~0); 9307#L12-2 assume !(0 == main_~i~0); 9306#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9304#L12 assume !(10 == main_~i~0); 9303#L12-2 assume !(0 == main_~i~0); 9302#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9300#L12 assume !(10 == main_~i~0); 9299#L12-2 assume !(0 == main_~i~0); 9298#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9257#L12 assume !(10 == main_~i~0); 9295#L12-2 assume !(0 == main_~i~0); 9294#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9256#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9238#L12 assume 10 == main_~i~0;main_~up~0 := 0; 9215#L12-2 [2018-11-28 23:17:43,513 INFO L796 eck$LassoCheckResult]: Loop: 9215#L12-2 assume !(0 == main_~i~0); 9216#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9254#L12 assume !(10 == main_~i~0); 9253#L12-2 assume !(0 == main_~i~0); 9252#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9251#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9250#L12 assume !(10 == main_~i~0); 9249#L12-2 assume !(0 == main_~i~0); 9248#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9247#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9246#L12 assume !(10 == main_~i~0); 9245#L12-2 assume !(0 == main_~i~0); 9244#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9242#L12 assume !(10 == main_~i~0); 9234#L12-2 assume !(0 == main_~i~0); 9237#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9236#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9231#L12 assume !(10 == main_~i~0); 9233#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 9293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9225#L12 assume !(10 == main_~i~0); 9226#L12-2 assume !(0 == main_~i~0); 9230#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9292#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9290#L12 assume !(10 == main_~i~0); 9289#L12-2 assume !(0 == main_~i~0); 9288#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9286#L12 assume !(10 == main_~i~0); 9285#L12-2 assume !(0 == main_~i~0); 9284#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9282#L12 assume !(10 == main_~i~0); 9281#L12-2 assume !(0 == main_~i~0); 9280#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9278#L12 assume !(10 == main_~i~0); 9277#L12-2 assume !(0 == main_~i~0); 9276#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9275#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9274#L12 assume !(10 == main_~i~0); 9273#L12-2 assume !(0 == main_~i~0); 9272#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9270#L12 assume !(10 == main_~i~0); 9269#L12-2 assume !(0 == main_~i~0); 9268#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9267#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9266#L12 assume !(10 == main_~i~0); 9265#L12-2 assume !(0 == main_~i~0); 9264#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9263#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9262#L12 assume !(10 == main_~i~0); 9261#L12-2 assume !(0 == main_~i~0); 9260#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9258#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9259#L12 assume 10 == main_~i~0;main_~up~0 := 0; 9215#L12-2 [2018-11-28 23:17:43,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 12 times [2018-11-28 23:17:43,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:43,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:43,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:43,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:43,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1151943822, now seen corresponding path program 12 times [2018-11-28 23:17:43,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:43,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:43,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:43,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:43,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:43,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:43,558 INFO L82 PathProgramCache]: Analyzing trace with hash 533812144, now seen corresponding path program 5 times [2018-11-28 23:17:43,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:43,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:43,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:43,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:43,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:43,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:43,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:43,800 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:17:43,820 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-28 23:17:43,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:43,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:43,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:43,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 23:17:44,231 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 62 [2018-11-28 23:17:44,248 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:44,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:44,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:44,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:44,249 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:44,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:44,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:44,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:44,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration20_Loop [2018-11-28 23:17:44,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:44,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:44,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:44,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:44,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:44,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:44,370 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:44,370 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:44,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:44,379 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:44,397 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:44,397 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:44,403 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:44,403 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:44,406 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:44,407 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:44,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:44,427 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:44,446 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:44,446 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_17=0} Honda state: {v_rep~unnamed0~0~false_17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:44,451 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:44,452 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:44,473 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:44,474 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:44,498 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:44,500 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:44,500 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:44,500 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:44,500 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:44,500 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:44,500 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:44,500 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:44,501 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:44,501 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration20_Loop [2018-11-28 23:17:44,501 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:44,501 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:44,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:44,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:44,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:44,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:44,624 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:44,625 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:44,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:44,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,637 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:17:44,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,638 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:17:44,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:44,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,653 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:44,654 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:44,654 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:44,657 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:44,657 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:44,657 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:44,657 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 15 Supporting invariants [] [2018-11-28 23:17:44,658 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:44,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:44,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:44,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-28 23:17:45,119 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:17:45,119 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 137 transitions. cyclomatic complexity: 17 Second operand 9 states. [2018-11-28 23:17:45,627 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 137 transitions. cyclomatic complexity: 17. Second operand 9 states. Result 607 states and 682 transitions. Complement of second has 27 states. [2018-11-28 23:17:45,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:17:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2018-11-28 23:17:45,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 60 letters. [2018-11-28 23:17:45,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:45,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 103 letters. Loop has 60 letters. [2018-11-28 23:17:45,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:45,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 120 letters. [2018-11-28 23:17:45,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:45,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 607 states and 682 transitions. [2018-11-28 23:17:45,637 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-11-28 23:17:45,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 607 states to 462 states and 516 transitions. [2018-11-28 23:17:45,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-28 23:17:45,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-28 23:17:45,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 462 states and 516 transitions. [2018-11-28 23:17:45,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:45,640 INFO L705 BuchiCegarLoop]: Abstraction has 462 states and 516 transitions. [2018-11-28 23:17:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states and 516 transitions. [2018-11-28 23:17:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 330. [2018-11-28 23:17:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-11-28 23:17:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 357 transitions. [2018-11-28 23:17:45,646 INFO L728 BuchiCegarLoop]: Abstraction has 330 states and 357 transitions. [2018-11-28 23:17:45,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:17:45,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:17:45,646 INFO L87 Difference]: Start difference. First operand 330 states and 357 transitions. Second operand 8 states. [2018-11-28 23:17:45,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:45,756 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2018-11-28 23:17:45,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:17:45,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 292 transitions. [2018-11-28 23:17:45,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-11-28 23:17:45,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 220 states and 249 transitions. [2018-11-28 23:17:45,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-28 23:17:45,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-28 23:17:45,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 249 transitions. [2018-11-28 23:17:45,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:45,766 INFO L705 BuchiCegarLoop]: Abstraction has 220 states and 249 transitions. [2018-11-28 23:17:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 249 transitions. [2018-11-28 23:17:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 131. [2018-11-28 23:17:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-28 23:17:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2018-11-28 23:17:45,773 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 147 transitions. [2018-11-28 23:17:45,773 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 147 transitions. [2018-11-28 23:17:45,773 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-28 23:17:45,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 147 transitions. [2018-11-28 23:17:45,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2018-11-28 23:17:45,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:45,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:45,779 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-28 23:17:45,779 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2018-11-28 23:17:45,779 INFO L794 eck$LassoCheckResult]: Stem: 11228#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 11229#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11240#L12 assume !(10 == main_~i~0); 11238#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 11237#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11230#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11231#L12 assume !(10 == main_~i~0); 11340#L12-2 assume !(0 == main_~i~0); 11339#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11337#L12 assume !(10 == main_~i~0); 11336#L12-2 assume !(0 == main_~i~0); 11335#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11333#L12 assume !(10 == main_~i~0); 11332#L12-2 assume !(0 == main_~i~0); 11331#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11330#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11329#L12 assume !(10 == main_~i~0); 11328#L12-2 assume !(0 == main_~i~0); 11327#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11326#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11325#L12 assume !(10 == main_~i~0); 11324#L12-2 assume !(0 == main_~i~0); 11323#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11322#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11321#L12 assume !(10 == main_~i~0); 11320#L12-2 assume !(0 == main_~i~0); 11319#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11317#L12 assume !(10 == main_~i~0); 11316#L12-2 assume !(0 == main_~i~0); 11315#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11314#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11313#L12 assume !(10 == main_~i~0); 11312#L12-2 assume !(0 == main_~i~0); 11311#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11310#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11270#L12 assume !(10 == main_~i~0); 11308#L12-2 assume !(0 == main_~i~0); 11307#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11269#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11247#L12 assume 10 == main_~i~0;main_~up~0 := 0; 11224#L12-2 [2018-11-28 23:17:45,780 INFO L796 eck$LassoCheckResult]: Loop: 11224#L12-2 assume !(0 == main_~i~0); 11225#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11267#L12 assume !(10 == main_~i~0); 11266#L12-2 assume !(0 == main_~i~0); 11265#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11264#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11263#L12 assume !(10 == main_~i~0); 11262#L12-2 assume !(0 == main_~i~0); 11261#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11259#L12 assume !(10 == main_~i~0); 11258#L12-2 assume !(0 == main_~i~0); 11257#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11256#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11255#L12 assume !(10 == main_~i~0); 11254#L12-2 assume !(0 == main_~i~0); 11253#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11252#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11251#L12 assume !(10 == main_~i~0); 11244#L12-2 assume !(0 == main_~i~0); 11246#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11245#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11241#L12 assume !(10 == main_~i~0); 11243#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 11306#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11304#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11234#L12 assume !(10 == main_~i~0); 11235#L12-2 assume !(0 == main_~i~0); 11239#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11303#L12 assume !(10 == main_~i~0); 11302#L12-2 assume !(0 == main_~i~0); 11301#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11300#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11299#L12 assume !(10 == main_~i~0); 11298#L12-2 assume !(0 == main_~i~0); 11297#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11296#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11295#L12 assume !(10 == main_~i~0); 11294#L12-2 assume !(0 == main_~i~0); 11293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11292#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11291#L12 assume !(10 == main_~i~0); 11290#L12-2 assume !(0 == main_~i~0); 11289#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11288#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11287#L12 assume !(10 == main_~i~0); 11286#L12-2 assume !(0 == main_~i~0); 11285#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11284#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11283#L12 assume !(10 == main_~i~0); 11282#L12-2 assume !(0 == main_~i~0); 11281#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11280#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11279#L12 assume !(10 == main_~i~0); 11278#L12-2 assume !(0 == main_~i~0); 11277#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11276#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11275#L12 assume !(10 == main_~i~0); 11274#L12-2 assume !(0 == main_~i~0); 11273#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11272#L12 assume 10 == main_~i~0;main_~up~0 := 0; 11224#L12-2 [2018-11-28 23:17:45,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:45,780 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 13 times [2018-11-28 23:17:45,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:45,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:45,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:45,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:45,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:45,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:45,802 INFO L82 PathProgramCache]: Analyzing trace with hash 336435933, now seen corresponding path program 13 times [2018-11-28 23:17:45,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:45,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:45,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:45,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:45,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:45,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:45,818 INFO L82 PathProgramCache]: Analyzing trace with hash 216392731, now seen corresponding path program 6 times [2018-11-28 23:17:45,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:45,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:45,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:45,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:45,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:45,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:45,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:45,955 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:17:46,025 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-11-28 23:17:46,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:46,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:46,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:46,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-28 23:17:46,563 WARN L180 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 61 [2018-11-28 23:17:46,580 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:46,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:46,581 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:46,581 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:46,581 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:46,581 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:46,581 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:46,581 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:46,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration21_Loop [2018-11-28 23:17:46,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:46,581 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:46,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:46,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:46,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:46,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:46,702 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:46,702 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:46,707 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:46,707 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:46,711 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:46,711 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:46,732 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:46,732 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:46,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:46,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:46,758 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:46,775 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:46,775 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:46,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:46,775 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:46,776 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:46,776 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:46,776 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:46,776 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:46,776 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration21_Loop [2018-11-28 23:17:46,776 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:46,776 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:46,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:46,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:46,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:46,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:46,879 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:46,879 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:46,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:46,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:46,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:46,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:46,881 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:17:46,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:46,882 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:17:46,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:46,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:46,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:46,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:46,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:46,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:46,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:46,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:46,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:46,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:46,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 [2018-11-28 23:17:46,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:46,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:46,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:46,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:46,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:46,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:46,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:46,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:46,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:46,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:46,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:46,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:46,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:46,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:46,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:46,907 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:46,913 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:46,913 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:46,914 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:46,914 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:46,914 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:46,914 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 8 Supporting invariants [] [2018-11-28 23:17:46,914 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:47,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:47,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:47,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-28 23:17:47,158 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-28 23:17:47,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 147 transitions. cyclomatic complexity: 19 Second operand 10 states. [2018-11-28 23:17:47,570 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 147 transitions. cyclomatic complexity: 19. Second operand 10 states. Result 719 states and 818 transitions. Complement of second has 31 states. [2018-11-28 23:17:47,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:17:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2018-11-28 23:17:47,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 64 letters. [2018-11-28 23:17:47,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:47,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 107 letters. Loop has 64 letters. [2018-11-28 23:17:47,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:47,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 128 letters. [2018-11-28 23:17:47,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:47,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 719 states and 818 transitions. [2018-11-28 23:17:47,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2018-11-28 23:17:47,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 719 states to 522 states and 590 transitions. [2018-11-28 23:17:47,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-28 23:17:47,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-28 23:17:47,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 590 transitions. [2018-11-28 23:17:47,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:47,583 INFO L705 BuchiCegarLoop]: Abstraction has 522 states and 590 transitions. [2018-11-28 23:17:47,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 590 transitions. [2018-11-28 23:17:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 338. [2018-11-28 23:17:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-28 23:17:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 367 transitions. [2018-11-28 23:17:47,590 INFO L728 BuchiCegarLoop]: Abstraction has 338 states and 367 transitions. [2018-11-28 23:17:47,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:17:47,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:17:47,591 INFO L87 Difference]: Start difference. First operand 338 states and 367 transitions. Second operand 9 states. [2018-11-28 23:17:47,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:47,734 INFO L93 Difference]: Finished difference Result 287 states and 320 transitions. [2018-11-28 23:17:47,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:17:47,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 320 transitions. [2018-11-28 23:17:47,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2018-11-28 23:17:47,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 236 states and 269 transitions. [2018-11-28 23:17:47,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-28 23:17:47,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-28 23:17:47,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 236 states and 269 transitions. [2018-11-28 23:17:47,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:47,743 INFO L705 BuchiCegarLoop]: Abstraction has 236 states and 269 transitions. [2018-11-28 23:17:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states and 269 transitions. [2018-11-28 23:17:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 139. [2018-11-28 23:17:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-28 23:17:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2018-11-28 23:17:47,748 INFO L728 BuchiCegarLoop]: Abstraction has 139 states and 157 transitions. [2018-11-28 23:17:47,748 INFO L608 BuchiCegarLoop]: Abstraction has 139 states and 157 transitions. [2018-11-28 23:17:47,748 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-28 23:17:47,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 157 transitions. [2018-11-28 23:17:47,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-28 23:17:47,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:47,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:47,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-28 23:17:47,754 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] [2018-11-28 23:17:47,754 INFO L794 eck$LassoCheckResult]: Stem: 13422#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 13423#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13434#L12 assume !(10 == main_~i~0); 13432#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 13431#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13424#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13425#L12 assume !(10 == main_~i~0); 13538#L12-2 assume !(0 == main_~i~0); 13537#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13536#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13535#L12 assume !(10 == main_~i~0); 13534#L12-2 assume !(0 == main_~i~0); 13533#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13532#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13531#L12 assume !(10 == main_~i~0); 13530#L12-2 assume !(0 == main_~i~0); 13529#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13528#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13527#L12 assume !(10 == main_~i~0); 13526#L12-2 assume !(0 == main_~i~0); 13525#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13524#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13523#L12 assume !(10 == main_~i~0); 13522#L12-2 assume !(0 == main_~i~0); 13521#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13520#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13519#L12 assume !(10 == main_~i~0); 13518#L12-2 assume !(0 == main_~i~0); 13517#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13516#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13515#L12 assume !(10 == main_~i~0); 13514#L12-2 assume !(0 == main_~i~0); 13513#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13512#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13511#L12 assume !(10 == main_~i~0); 13510#L12-2 assume !(0 == main_~i~0); 13509#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13508#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13468#L12 assume !(10 == main_~i~0); 13506#L12-2 assume !(0 == main_~i~0); 13505#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13467#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13441#L12 assume 10 == main_~i~0;main_~up~0 := 0; 13418#L12-2 [2018-11-28 23:17:47,754 INFO L796 eck$LassoCheckResult]: Loop: 13418#L12-2 assume !(0 == main_~i~0); 13419#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13466#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13465#L12 assume !(10 == main_~i~0); 13464#L12-2 assume !(0 == main_~i~0); 13463#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13462#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13461#L12 assume !(10 == main_~i~0); 13460#L12-2 assume !(0 == main_~i~0); 13459#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13458#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13457#L12 assume !(10 == main_~i~0); 13456#L12-2 assume !(0 == main_~i~0); 13455#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13454#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13453#L12 assume !(10 == main_~i~0); 13452#L12-2 assume !(0 == main_~i~0); 13451#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13450#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13449#L12 assume !(10 == main_~i~0); 13448#L12-2 assume !(0 == main_~i~0); 13447#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13446#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13445#L12 assume !(10 == main_~i~0); 13438#L12-2 assume !(0 == main_~i~0); 13440#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13439#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13435#L12 assume !(10 == main_~i~0); 13437#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 13504#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13502#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13428#L12 assume !(10 == main_~i~0); 13429#L12-2 assume !(0 == main_~i~0); 13433#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13503#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13501#L12 assume !(10 == main_~i~0); 13500#L12-2 assume !(0 == main_~i~0); 13499#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13498#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13497#L12 assume !(10 == main_~i~0); 13496#L12-2 assume !(0 == main_~i~0); 13495#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13493#L12 assume !(10 == main_~i~0); 13492#L12-2 assume !(0 == main_~i~0); 13491#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13489#L12 assume !(10 == main_~i~0); 13488#L12-2 assume !(0 == main_~i~0); 13487#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13486#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13485#L12 assume !(10 == main_~i~0); 13484#L12-2 assume !(0 == main_~i~0); 13483#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13481#L12 assume !(10 == main_~i~0); 13480#L12-2 assume !(0 == main_~i~0); 13479#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13477#L12 assume !(10 == main_~i~0); 13476#L12-2 assume !(0 == main_~i~0); 13475#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13473#L12 assume !(10 == main_~i~0); 13472#L12-2 assume !(0 == main_~i~0); 13471#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13469#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13470#L12 assume 10 == main_~i~0;main_~up~0 := 0; 13418#L12-2 [2018-11-28 23:17:47,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:47,754 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 14 times [2018-11-28 23:17:47,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:47,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:47,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:47,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:47,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:47,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:47,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1847643336, now seen corresponding path program 14 times [2018-11-28 23:17:47,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:47,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:47,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:47,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:47,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:47,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:47,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1125533446, now seen corresponding path program 7 times [2018-11-28 23:17:47,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:47,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:47,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:47,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:47,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:48,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:48,462 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:48,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:48,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:48,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:48,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-28 23:17:48,991 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 64 [2018-11-28 23:17:48,998 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:48,999 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:48,999 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:48,999 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:48,999 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:48,999 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:48,999 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:48,999 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:48,999 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration22_Loop [2018-11-28 23:17:48,999 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:48,999 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:49,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,077 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:49,079 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:49,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:49,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:49,106 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:49,107 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:49,114 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:49,115 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:17:49,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:49,140 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:49,144 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:49,163 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:49,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:49,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:49,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:49,163 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:49,163 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:49,163 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:49,164 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:49,164 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration22_Loop [2018-11-28 23:17:49,164 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:49,164 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:49,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,248 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:49,250 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:49,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:49,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:49,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:49,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:49,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:49,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:49,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:49,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,271 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:49,272 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:49,276 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:49,276 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:49,276 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:49,276 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:49,277 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2018-11-28 23:17:49,277 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:49,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:49,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:49,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 373 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-28 23:17:49,720 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-11-28 23:17:49,720 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 157 transitions. cyclomatic complexity: 21 Second operand 11 states. [2018-11-28 23:17:50,646 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 157 transitions. cyclomatic complexity: 21. Second operand 11 states. Result 847 states and 974 transitions. Complement of second has 35 states. [2018-11-28 23:17:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:17:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2018-11-28 23:17:50,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 68 letters. [2018-11-28 23:17:50,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:50,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 111 letters. Loop has 68 letters. [2018-11-28 23:17:50,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:50,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 136 letters. [2018-11-28 23:17:50,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:50,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 847 states and 974 transitions. [2018-11-28 23:17:50,658 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2018-11-28 23:17:50,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 847 states to 590 states and 674 transitions. [2018-11-28 23:17:50,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-28 23:17:50,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-28 23:17:50,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 674 transitions. [2018-11-28 23:17:50,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:50,664 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 674 transitions. [2018-11-28 23:17:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 674 transitions. [2018-11-28 23:17:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 346. [2018-11-28 23:17:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-11-28 23:17:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 377 transitions. [2018-11-28 23:17:50,675 INFO L728 BuchiCegarLoop]: Abstraction has 346 states and 377 transitions. [2018-11-28 23:17:50,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:17:50,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:17:50,676 INFO L87 Difference]: Start difference. First operand 346 states and 377 transitions. Second operand 10 states. [2018-11-28 23:17:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:50,841 INFO L93 Difference]: Finished difference Result 311 states and 348 transitions. [2018-11-28 23:17:50,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:17:50,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 311 states and 348 transitions. [2018-11-28 23:17:50,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-11-28 23:17:50,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 311 states to 252 states and 289 transitions. [2018-11-28 23:17:50,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-28 23:17:50,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-28 23:17:50,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 289 transitions. [2018-11-28 23:17:50,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:50,847 INFO L705 BuchiCegarLoop]: Abstraction has 252 states and 289 transitions. [2018-11-28 23:17:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 289 transitions. [2018-11-28 23:17:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 147. [2018-11-28 23:17:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-28 23:17:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2018-11-28 23:17:50,850 INFO L728 BuchiCegarLoop]: Abstraction has 147 states and 167 transitions. [2018-11-28 23:17:50,850 INFO L608 BuchiCegarLoop]: Abstraction has 147 states and 167 transitions. [2018-11-28 23:17:50,851 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-28 23:17:50,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 167 transitions. [2018-11-28 23:17:50,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2018-11-28 23:17:50,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:50,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:50,852 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-28 23:17:50,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2018-11-28 23:17:50,853 INFO L794 eck$LassoCheckResult]: Stem: 15817#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 15818#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15829#L12 assume !(10 == main_~i~0); 15827#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 15826#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15819#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15820#L12 assume !(10 == main_~i~0); 15937#L12-2 assume !(0 == main_~i~0); 15936#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15935#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15934#L12 assume !(10 == main_~i~0); 15933#L12-2 assume !(0 == main_~i~0); 15932#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15931#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15930#L12 assume !(10 == main_~i~0); 15929#L12-2 assume !(0 == main_~i~0); 15928#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15927#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15926#L12 assume !(10 == main_~i~0); 15925#L12-2 assume !(0 == main_~i~0); 15924#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15923#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15922#L12 assume !(10 == main_~i~0); 15921#L12-2 assume !(0 == main_~i~0); 15920#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15919#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15918#L12 assume !(10 == main_~i~0); 15917#L12-2 assume !(0 == main_~i~0); 15916#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15915#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15914#L12 assume !(10 == main_~i~0); 15913#L12-2 assume !(0 == main_~i~0); 15912#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15911#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15910#L12 assume !(10 == main_~i~0); 15909#L12-2 assume !(0 == main_~i~0); 15908#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15907#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15869#L12 assume !(10 == main_~i~0); 15905#L12-2 assume !(0 == main_~i~0); 15904#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15836#L12 assume 10 == main_~i~0;main_~up~0 := 0; 15813#L12-2 [2018-11-28 23:17:50,853 INFO L796 eck$LassoCheckResult]: Loop: 15813#L12-2 assume !(0 == main_~i~0); 15814#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15865#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15864#L12 assume !(10 == main_~i~0); 15863#L12-2 assume !(0 == main_~i~0); 15862#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15861#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15860#L12 assume !(10 == main_~i~0); 15859#L12-2 assume !(0 == main_~i~0); 15858#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15857#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15856#L12 assume !(10 == main_~i~0); 15855#L12-2 assume !(0 == main_~i~0); 15854#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15852#L12 assume !(10 == main_~i~0); 15851#L12-2 assume !(0 == main_~i~0); 15850#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15848#L12 assume !(10 == main_~i~0); 15847#L12-2 assume !(0 == main_~i~0); 15846#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15844#L12 assume !(10 == main_~i~0); 15843#L12-2 assume !(0 == main_~i~0); 15842#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15840#L12 assume !(10 == main_~i~0); 15833#L12-2 assume !(0 == main_~i~0); 15835#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15834#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15830#L12 assume !(10 == main_~i~0); 15832#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 15903#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15901#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15823#L12 assume !(10 == main_~i~0); 15824#L12-2 assume !(0 == main_~i~0); 15828#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15900#L12 assume !(10 == main_~i~0); 15899#L12-2 assume !(0 == main_~i~0); 15898#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15897#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15896#L12 assume !(10 == main_~i~0); 15895#L12-2 assume !(0 == main_~i~0); 15894#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15893#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15892#L12 assume !(10 == main_~i~0); 15891#L12-2 assume !(0 == main_~i~0); 15890#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15889#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15888#L12 assume !(10 == main_~i~0); 15887#L12-2 assume !(0 == main_~i~0); 15886#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15885#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15884#L12 assume !(10 == main_~i~0); 15883#L12-2 assume !(0 == main_~i~0); 15882#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15881#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15880#L12 assume !(10 == main_~i~0); 15879#L12-2 assume !(0 == main_~i~0); 15878#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15877#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15876#L12 assume !(10 == main_~i~0); 15875#L12-2 assume !(0 == main_~i~0); 15874#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15873#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15872#L12 assume !(10 == main_~i~0); 15871#L12-2 assume !(0 == main_~i~0); 15870#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15866#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15867#L12 assume 10 == main_~i~0;main_~up~0 := 0; 15813#L12-2 [2018-11-28 23:17:50,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:50,853 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 15 times [2018-11-28 23:17:50,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:50,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:50,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:50,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:50,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:50,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:50,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1176703283, now seen corresponding path program 15 times [2018-11-28 23:17:50,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:50,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:50,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:50,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:50,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:50,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1395997809, now seen corresponding path program 8 times [2018-11-28 23:17:50,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:50,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:50,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:50,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:50,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1077 proven. 120 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:51,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:51,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:51,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:17:51,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:17:51,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:51,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1077 proven. 120 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:51,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:51,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-28 23:17:51,785 WARN L180 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 69 [2018-11-28 23:17:51,802 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:51,802 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:51,802 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:51,802 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:51,802 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:51,802 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:51,803 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:51,803 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:51,803 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration23_Loop [2018-11-28 23:17:51,803 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:51,803 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:51,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:51,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:51,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:51,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:51,886 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:51,886 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:51,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:51,891 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:51,909 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:51,910 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_23=1} Honda state: {v_rep~unnamed0~0~true_23=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:51,915 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:51,915 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:51,918 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:51,918 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:51,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:51,939 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:51,957 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:51,958 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_23=0} Honda state: {v_rep~unnamed0~0~false_23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:51,964 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:51,964 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:51,987 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:51,987 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:52,102 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:52,104 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:52,104 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:52,104 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:52,104 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:52,104 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:52,104 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:52,104 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:52,104 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:52,105 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration23_Loop [2018-11-28 23:17:52,105 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:52,105 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:52,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:52,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:52,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:52,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:52,189 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:52,189 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:52,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:52,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:52,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:52,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:52,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:52,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:52,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:52,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:52,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:52,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:52,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:52,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:52,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:52,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:52,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:52,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:52,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:52,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:52,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:52,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:52,198 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:17:52,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:52,198 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:17:52,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:52,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:52,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:52,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:52,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:52,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:52,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:52,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:52,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:52,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:52,202 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:52,203 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:52,203 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:52,203 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:52,203 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:52,203 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:52,204 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2018-11-28 23:17:52,204 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:52,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:52,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:52,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-28 23:17:52,595 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2018-11-28 23:17:52,595 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 167 transitions. cyclomatic complexity: 23 Second operand 12 states. [2018-11-28 23:17:53,831 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-28 23:17:54,600 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 167 transitions. cyclomatic complexity: 23. Second operand 12 states. Result 992 states and 1151 transitions. Complement of second has 39 states. [2018-11-28 23:17:54,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:17:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2018-11-28 23:17:54,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 72 letters. [2018-11-28 23:17:54,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:54,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 115 letters. Loop has 72 letters. [2018-11-28 23:17:54,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:54,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 144 letters. [2018-11-28 23:17:54,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:54,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 992 states and 1151 transitions. [2018-11-28 23:17:54,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2018-11-28 23:17:54,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 992 states to 667 states and 769 transitions. [2018-11-28 23:17:54,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-28 23:17:54,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-28 23:17:54,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 667 states and 769 transitions. [2018-11-28 23:17:54,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:54,613 INFO L705 BuchiCegarLoop]: Abstraction has 667 states and 769 transitions. [2018-11-28 23:17:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 769 transitions. [2018-11-28 23:17:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 354. [2018-11-28 23:17:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-11-28 23:17:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 387 transitions. [2018-11-28 23:17:54,621 INFO L728 BuchiCegarLoop]: Abstraction has 354 states and 387 transitions. [2018-11-28 23:17:54,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:17:54,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:17:54,622 INFO L87 Difference]: Start difference. First operand 354 states and 387 transitions. Second operand 11 states. [2018-11-28 23:17:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:54,804 INFO L93 Difference]: Finished difference Result 335 states and 376 transitions. [2018-11-28 23:17:54,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:17:54,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 376 transitions. [2018-11-28 23:17:54,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-28 23:17:54,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 268 states and 309 transitions. [2018-11-28 23:17:54,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-28 23:17:54,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-28 23:17:54,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 309 transitions. [2018-11-28 23:17:54,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:54,812 INFO L705 BuchiCegarLoop]: Abstraction has 268 states and 309 transitions. [2018-11-28 23:17:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 309 transitions. [2018-11-28 23:17:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 155. [2018-11-28 23:17:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-28 23:17:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2018-11-28 23:17:54,815 INFO L728 BuchiCegarLoop]: Abstraction has 155 states and 177 transitions. [2018-11-28 23:17:54,815 INFO L608 BuchiCegarLoop]: Abstraction has 155 states and 177 transitions. [2018-11-28 23:17:54,815 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-28 23:17:54,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 177 transitions. [2018-11-28 23:17:54,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2018-11-28 23:17:54,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:54,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:54,817 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-28 23:17:54,817 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] [2018-11-28 23:17:54,817 INFO L794 eck$LassoCheckResult]: Stem: 18430#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 18431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18442#L12 assume !(10 == main_~i~0); 18440#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 18439#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18432#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18433#L12 assume !(10 == main_~i~0); 18554#L12-2 assume !(0 == main_~i~0); 18553#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18552#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18551#L12 assume !(10 == main_~i~0); 18550#L12-2 assume !(0 == main_~i~0); 18549#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18548#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18547#L12 assume !(10 == main_~i~0); 18546#L12-2 assume !(0 == main_~i~0); 18545#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18544#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18543#L12 assume !(10 == main_~i~0); 18542#L12-2 assume !(0 == main_~i~0); 18541#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18540#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18539#L12 assume !(10 == main_~i~0); 18538#L12-2 assume !(0 == main_~i~0); 18537#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18536#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18535#L12 assume !(10 == main_~i~0); 18534#L12-2 assume !(0 == main_~i~0); 18533#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18532#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18531#L12 assume !(10 == main_~i~0); 18530#L12-2 assume !(0 == main_~i~0); 18529#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18528#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18527#L12 assume !(10 == main_~i~0); 18526#L12-2 assume !(0 == main_~i~0); 18525#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18524#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18484#L12 assume !(10 == main_~i~0); 18522#L12-2 assume !(0 == main_~i~0); 18521#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18483#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18449#L12 assume 10 == main_~i~0;main_~up~0 := 0; 18426#L12-2 [2018-11-28 23:17:54,817 INFO L796 eck$LassoCheckResult]: Loop: 18426#L12-2 assume !(0 == main_~i~0); 18427#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18481#L12 assume !(10 == main_~i~0); 18480#L12-2 assume !(0 == main_~i~0); 18479#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18477#L12 assume !(10 == main_~i~0); 18476#L12-2 assume !(0 == main_~i~0); 18475#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18473#L12 assume !(10 == main_~i~0); 18472#L12-2 assume !(0 == main_~i~0); 18471#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18470#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18469#L12 assume !(10 == main_~i~0); 18468#L12-2 assume !(0 == main_~i~0); 18467#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18466#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18465#L12 assume !(10 == main_~i~0); 18464#L12-2 assume !(0 == main_~i~0); 18463#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18462#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18461#L12 assume !(10 == main_~i~0); 18460#L12-2 assume !(0 == main_~i~0); 18459#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18458#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18457#L12 assume !(10 == main_~i~0); 18456#L12-2 assume !(0 == main_~i~0); 18455#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18454#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18453#L12 assume !(10 == main_~i~0); 18446#L12-2 assume !(0 == main_~i~0); 18448#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18447#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18443#L12 assume !(10 == main_~i~0); 18445#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 18520#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18518#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18436#L12 assume !(10 == main_~i~0); 18437#L12-2 assume !(0 == main_~i~0); 18441#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18519#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18517#L12 assume !(10 == main_~i~0); 18516#L12-2 assume !(0 == main_~i~0); 18515#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18514#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18513#L12 assume !(10 == main_~i~0); 18512#L12-2 assume !(0 == main_~i~0); 18511#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18510#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18509#L12 assume !(10 == main_~i~0); 18508#L12-2 assume !(0 == main_~i~0); 18507#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18506#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18505#L12 assume !(10 == main_~i~0); 18504#L12-2 assume !(0 == main_~i~0); 18503#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18502#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18501#L12 assume !(10 == main_~i~0); 18500#L12-2 assume !(0 == main_~i~0); 18499#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18498#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18497#L12 assume !(10 == main_~i~0); 18496#L12-2 assume !(0 == main_~i~0); 18495#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18493#L12 assume !(10 == main_~i~0); 18492#L12-2 assume !(0 == main_~i~0); 18491#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18489#L12 assume !(10 == main_~i~0); 18488#L12-2 assume !(0 == main_~i~0); 18487#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18485#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18486#L12 assume 10 == main_~i~0;main_~up~0 := 0; 18426#L12-2 [2018-11-28 23:17:54,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 16 times [2018-11-28 23:17:54,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:54,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:54,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:54,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:54,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:54,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:54,826 INFO L82 PathProgramCache]: Analyzing trace with hash 289875998, now seen corresponding path program 16 times [2018-11-28 23:17:54,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:54,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:54,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:54,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:54,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1498053540, now seen corresponding path program 9 times [2018-11-28 23:17:54,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:54,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:54,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:54,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:54,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:55,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:55,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:55,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:17:55,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-28 23:17:55,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:17:55,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:17:55,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:55,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-28 23:17:55,663 WARN L180 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 70 [2018-11-28 23:17:55,669 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:55,669 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:55,670 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:55,670 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:55,670 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:55,670 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:55,670 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:55,670 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:55,671 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration24_Loop [2018-11-28 23:17:55,671 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:55,671 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:55,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:55,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:55,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:55,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:55,742 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:55,743 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:55,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:55,747 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:55,751 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:55,751 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:55,771 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:55,771 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:55,791 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:55,791 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_25=1} Honda state: {v_rep~unnamed0~0~true_25=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:55,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:55,796 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:55,815 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:55,815 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_25=0} Honda state: {v_rep~unnamed0~0~false_25=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:55,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:55,821 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:55,843 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:55,844 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:55,847 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:55,864 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:55,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:55,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:55,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:55,864 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:55,864 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:55,864 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:55,865 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:55,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration24_Loop [2018-11-28 23:17:55,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:55,865 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:55,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:55,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:55,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:55,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:55,947 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:55,947 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:55,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:55,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:55,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:55,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:55,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:55,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:55,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:55,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:55,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:55,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:55,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:55,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:55,952 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:17:55,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:55,953 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:17:55,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:55,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:55,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:55,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:55,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:55,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:55,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:55,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:55,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:55,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:55,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:55,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:55,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:55,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:55,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:55,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:55,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:55,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:55,959 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:55,961 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:55,961 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:55,961 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:55,961 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:55,962 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:55,962 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2018-11-28 23:17:55,962 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:56,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:56,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:56,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-28 23:17:56,341 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2018-11-28 23:17:56,341 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 155 states and 177 transitions. cyclomatic complexity: 25 Second operand 13 states. [2018-11-28 23:17:57,510 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 155 states and 177 transitions. cyclomatic complexity: 25. Second operand 13 states. Result 1168 states and 1366 transitions. Complement of second has 43 states. [2018-11-28 23:17:57,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:17:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 98 transitions. [2018-11-28 23:17:57,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 43 letters. Loop has 76 letters. [2018-11-28 23:17:57,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:57,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 119 letters. Loop has 76 letters. [2018-11-28 23:17:57,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:57,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 43 letters. Loop has 152 letters. [2018-11-28 23:17:57,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:57,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1168 states and 1366 transitions. [2018-11-28 23:17:57,524 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2018-11-28 23:17:57,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1168 states to 767 states and 892 transitions. [2018-11-28 23:17:57,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-28 23:17:57,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2018-11-28 23:17:57,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 767 states and 892 transitions. [2018-11-28 23:17:57,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:57,529 INFO L705 BuchiCegarLoop]: Abstraction has 767 states and 892 transitions. [2018-11-28 23:17:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states and 892 transitions. [2018-11-28 23:17:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 376. [2018-11-28 23:17:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-28 23:17:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 413 transitions. [2018-11-28 23:17:57,539 INFO L728 BuchiCegarLoop]: Abstraction has 376 states and 413 transitions. [2018-11-28 23:17:57,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:17:57,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:17:57,540 INFO L87 Difference]: Start difference. First operand 376 states and 413 transitions. Second operand 12 states. [2018-11-28 23:17:57,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:57,668 INFO L93 Difference]: Finished difference Result 359 states and 404 transitions. [2018-11-28 23:17:57,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:17:57,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359 states and 404 transitions. [2018-11-28 23:17:57,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 83 [2018-11-28 23:17:57,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359 states to 284 states and 329 transitions. [2018-11-28 23:17:57,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-28 23:17:57,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-28 23:17:57,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 329 transitions. [2018-11-28 23:17:57,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:57,680 INFO L705 BuchiCegarLoop]: Abstraction has 284 states and 329 transitions. [2018-11-28 23:17:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 329 transitions. [2018-11-28 23:17:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 163. [2018-11-28 23:17:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-28 23:17:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 187 transitions. [2018-11-28 23:17:57,685 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 187 transitions. [2018-11-28 23:17:57,685 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 187 transitions. [2018-11-28 23:17:57,685 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-28 23:17:57,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 187 transitions. [2018-11-28 23:17:57,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-28 23:17:57,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:57,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:57,687 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-28 23:17:57,687 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2018-11-28 23:17:57,687 INFO L794 eck$LassoCheckResult]: Stem: 21306#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 21307#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21318#L12 assume !(10 == main_~i~0); 21316#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 21315#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21308#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21309#L12 assume !(10 == main_~i~0); 21434#L12-2 assume !(0 == main_~i~0); 21433#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21432#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21431#L12 assume !(10 == main_~i~0); 21430#L12-2 assume !(0 == main_~i~0); 21429#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21428#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21427#L12 assume !(10 == main_~i~0); 21426#L12-2 assume !(0 == main_~i~0); 21425#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21424#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21423#L12 assume !(10 == main_~i~0); 21422#L12-2 assume !(0 == main_~i~0); 21421#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21420#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21419#L12 assume !(10 == main_~i~0); 21418#L12-2 assume !(0 == main_~i~0); 21417#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21416#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21415#L12 assume !(10 == main_~i~0); 21414#L12-2 assume !(0 == main_~i~0); 21413#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21411#L12 assume !(10 == main_~i~0); 21410#L12-2 assume !(0 == main_~i~0); 21409#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21407#L12 assume !(10 == main_~i~0); 21406#L12-2 assume !(0 == main_~i~0); 21405#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21404#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21366#L12 assume !(10 == main_~i~0); 21402#L12-2 assume !(0 == main_~i~0); 21401#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21365#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21325#L12 assume 10 == main_~i~0;main_~up~0 := 0; 21302#L12-2 [2018-11-28 23:17:57,687 INFO L796 eck$LassoCheckResult]: Loop: 21302#L12-2 assume !(0 == main_~i~0); 21303#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21362#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21361#L12 assume !(10 == main_~i~0); 21360#L12-2 assume !(0 == main_~i~0); 21359#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21358#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21357#L12 assume !(10 == main_~i~0); 21356#L12-2 assume !(0 == main_~i~0); 21355#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21354#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21353#L12 assume !(10 == main_~i~0); 21352#L12-2 assume !(0 == main_~i~0); 21351#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21350#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21349#L12 assume !(10 == main_~i~0); 21348#L12-2 assume !(0 == main_~i~0); 21347#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21346#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21345#L12 assume !(10 == main_~i~0); 21344#L12-2 assume !(0 == main_~i~0); 21343#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21342#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21341#L12 assume !(10 == main_~i~0); 21340#L12-2 assume !(0 == main_~i~0); 21339#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21337#L12 assume !(10 == main_~i~0); 21336#L12-2 assume !(0 == main_~i~0); 21335#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21333#L12 assume !(10 == main_~i~0); 21332#L12-2 assume !(0 == main_~i~0); 21331#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21330#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21329#L12 assume !(10 == main_~i~0); 21322#L12-2 assume !(0 == main_~i~0); 21324#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21323#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21319#L12 assume !(10 == main_~i~0); 21321#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 21400#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21398#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21312#L12 assume !(10 == main_~i~0); 21313#L12-2 assume !(0 == main_~i~0); 21317#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21399#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21397#L12 assume !(10 == main_~i~0); 21396#L12-2 assume !(0 == main_~i~0); 21395#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21394#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21393#L12 assume !(10 == main_~i~0); 21392#L12-2 assume !(0 == main_~i~0); 21391#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21390#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21389#L12 assume !(10 == main_~i~0); 21388#L12-2 assume !(0 == main_~i~0); 21387#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21386#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21385#L12 assume !(10 == main_~i~0); 21384#L12-2 assume !(0 == main_~i~0); 21383#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21382#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21381#L12 assume !(10 == main_~i~0); 21380#L12-2 assume !(0 == main_~i~0); 21379#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21378#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21377#L12 assume !(10 == main_~i~0); 21376#L12-2 assume !(0 == main_~i~0); 21375#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21373#L12 assume !(10 == main_~i~0); 21372#L12-2 assume !(0 == main_~i~0); 21371#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21370#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21369#L12 assume !(10 == main_~i~0); 21368#L12-2 assume !(0 == main_~i~0); 21367#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21363#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21364#L12 assume 10 == main_~i~0;main_~up~0 := 0; 21302#L12-2 [2018-11-28 23:17:57,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 17 times [2018-11-28 23:17:57,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:57,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:57,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:57,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:57,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:57,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash -312487543, now seen corresponding path program 17 times [2018-11-28 23:17:57,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:57,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:57,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:57,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:57,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:57,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:57,716 INFO L82 PathProgramCache]: Analyzing trace with hash 799661767, now seen corresponding path program 10 times [2018-11-28 23:17:57,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:57,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:57,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:57,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:57,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:58,379 WARN L180 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 78 [2018-11-28 23:17:58,580 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 47 [2018-11-28 23:17:58,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:17:58 BoogieIcfgContainer [2018-11-28 23:17:58,621 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:17:58,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:17:58,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:17:58,622 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:17:58,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:27" (3/4) ... [2018-11-28 23:17:58,626 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 23:17:58,699 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:17:58,699 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:17:58,700 INFO L168 Benchmark]: Toolchain (without parser) took 31677.93 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 452.5 MB). Free memory was 951.3 MB in the beginning and 1.4 GB in the end (delta: -434.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:17:58,701 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:17:58,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.48 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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. [2018-11-28 23:17:58,702 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.87 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. [2018-11-28 23:17:58,702 INFO L168 Benchmark]: Boogie Preprocessor took 26.85 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. [2018-11-28 23:17:58,702 INFO L168 Benchmark]: RCFGBuilder took 337.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:17:58,702 INFO L168 Benchmark]: BuchiAutomizer took 30862.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 328.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -282.3 MB). Peak memory consumption was 634.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:17:58,703 INFO L168 Benchmark]: Witness Printer took 77.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:17:58,705 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.48 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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 44.87 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 26.85 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 337.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30862.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 328.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -282.3 MB). Peak memory consumption was 634.6 MB. Max. memory is 11.5 GB. * Witness Printer took 77.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. 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 35 terminating modules (22 trivial, 12 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + 6 and consists of 8 locations. One deterministic module has affine ranking function -2 * i + 13 and consists of 10 locations. One deterministic module has affine ranking function -1 * i + 7 and consists of 12 locations. One deterministic module has affine ranking function -2 * i + 15 and consists of 14 locations. One deterministic module has affine ranking function -1 * i + 8 and consists of 16 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 18 locations. One deterministic module has affine ranking function -1 * i + 9 and consists of 20 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 22 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 22 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 163 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.7s and 25 iterations. TraceHistogramMax:20. Analysis of lassos took 18.1s. Construction of modules took 4.1s. Büchi inclusion checks took 7.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 34. Automata minimization 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 2269 StatesRemovedByMinimization, 34 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 163 states and ocurred in iteration 24. Nontrivial modules had stage [12, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1368/3680 HoareTripleCheckerStatistics: 262 SDtfs, 787 SDslu, 9 SDs, 0 SdLazy, 2168 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc0 concLT9 SILN0 SILU0 SILI10 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax167 hnf100 lsp41 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq181 hnf93 smp84 dnf134 smp100 tf108 neg93 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 26 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24e3d2bd=0, \result=0, i=10} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 Loop: [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...