./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-restricted-15/UpAndDownIneq_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 2b329fcd1c2ada34efa1c491c6d8d75d6e8a1856 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0ed9222-m [2019-01-14 02:23:38,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:23:38,174 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:23:38,186 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:23:38,186 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:23:38,187 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:23:38,189 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:23:38,191 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:23:38,193 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:23:38,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:23:38,195 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:23:38,195 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:23:38,196 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:23:38,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:23:38,200 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:23:38,203 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:23:38,204 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:23:38,209 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:23:38,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:23:38,219 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:23:38,220 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:23:38,226 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:23:38,232 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:23:38,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:23:38,234 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:23:38,235 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:23:38,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:23:38,241 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:23:38,242 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:23:38,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:23:38,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:23:38,247 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:23:38,247 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:23:38,248 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:23:38,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:23:38,253 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:23:38,254 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:23:38,286 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:23:38,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:23:38,289 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:23:38,290 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:23:38,290 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:23:38,291 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:23:38,291 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:23:38,291 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:23:38,291 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:23:38,291 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:23:38,291 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:23:38,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:23:38,292 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:23:38,292 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:23:38,292 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:23:38,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:23:38,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:23:38,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:23:38,293 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:23:38,294 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:23:38,294 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:23:38,295 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:23:38,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:23:38,295 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:23:38,295 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:23:38,295 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:23:38,296 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:23:38,296 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:23:38,297 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:23:38,297 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 -> 2b329fcd1c2ada34efa1c491c6d8d75d6e8a1856 [2019-01-14 02:23:38,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:23:38,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:23:38,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:23:38,388 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:23:38,389 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:23:38,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c [2019-01-14 02:23:38,449 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d20ae1d3/a55f9b27b5814624a42f16f96cb5f7a3/FLAG2f4da5344 [2019-01-14 02:23:38,897 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:23:38,898 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c [2019-01-14 02:23:38,907 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d20ae1d3/a55f9b27b5814624a42f16f96cb5f7a3/FLAG2f4da5344 [2019-01-14 02:23:39,267 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d20ae1d3/a55f9b27b5814624a42f16f96cb5f7a3 [2019-01-14 02:23:39,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:23:39,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:23:39,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:23:39,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:23:39,284 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:23:39,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:23:39" (1/1) ... [2019-01-14 02:23:39,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b748759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39, skipping insertion in model container [2019-01-14 02:23:39,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:23:39" (1/1) ... [2019-01-14 02:23:39,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:23:39,321 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:23:39,494 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:23:39,498 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:23:39,514 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:23:39,526 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:23:39,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39 WrapperNode [2019-01-14 02:23:39,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:23:39,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:23:39,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:23:39,528 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:23:39,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39" (1/1) ... [2019-01-14 02:23:39,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39" (1/1) ... [2019-01-14 02:23:39,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:23:39,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:23:39,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:23:39,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:23:39,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39" (1/1) ... [2019-01-14 02:23:39,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39" (1/1) ... [2019-01-14 02:23:39,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39" (1/1) ... [2019-01-14 02:23:39,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39" (1/1) ... [2019-01-14 02:23:39,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39" (1/1) ... [2019-01-14 02:23:39,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39" (1/1) ... [2019-01-14 02:23:39,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39" (1/1) ... [2019-01-14 02:23:39,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:23:39,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:23:39,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:23:39,587 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:23:39,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:39,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:23:39,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:23:39,850 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:23:39,851 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:23:39,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:23:39 BoogieIcfgContainer [2019-01-14 02:23:39,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:23:39,853 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:23:39,853 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:23:39,858 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:23:39,859 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:23:39,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:23:39" (1/3) ... [2019-01-14 02:23:39,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a8568ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:23:39, skipping insertion in model container [2019-01-14 02:23:39,860 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:23:39,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:23:39" (2/3) ... [2019-01-14 02:23:39,861 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a8568ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:23:39, skipping insertion in model container [2019-01-14 02:23:39,861 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:23:39,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:23:39" (3/3) ... [2019-01-14 02:23:39,864 INFO L375 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq_false-termination_true-no-overflow.c [2019-01-14 02:23:39,941 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:23:39,941 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:23:39,942 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:23:39,942 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:23:39,942 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:23:39,942 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:23:39,943 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:23:39,943 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:23:39,943 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:23:39,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-14 02:23:39,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:23:39,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:39,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:39,986 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:23:39,986 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:23:39,986 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:23:39,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-14 02:23:39,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:23:39,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:39,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:39,989 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:23:39,989 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:23:39,998 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 [2019-01-14 02:23:39,998 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6#L12true assume main_~i~0 >= 10;main_~up~0 := 0; 3#L12-2true assume main_~i~0 <= 0;main_~up~0 := 1; 9#L15-1true assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2019-01-14 02:23:40,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:40,006 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:23:40,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:40,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:40,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:40,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:40,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:40,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2019-01-14 02:23:40,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:40,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:40,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:40,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:40,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:40,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:23:40,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:23:40,169 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:23:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:23:40,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:23:40,185 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-14 02:23:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:40,357 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-14 02:23:40,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:23:40,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-01-14 02:23:40,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:23:40,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 9 states and 13 transitions. [2019-01-14 02:23:40,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:23:40,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:23:40,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-14 02:23:40,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:23:40,370 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:23:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-14 02:23:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-14 02:23:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:23:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-01-14 02:23:40,400 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:23:40,400 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:23:40,400 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:23:40,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2019-01-14 02:23:40,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:23:40,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:40,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:40,402 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:23:40,402 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:23:40,403 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 [2019-01-14 02:23:40,403 INFO L796 eck$LassoCheckResult]: Loop: 38#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 43#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 35#L12-2 assume !(main_~i~0 <= 0); 36#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 38#L18-1 [2019-01-14 02:23:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:23:40,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:40,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:40,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:40,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:40,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:40,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:40,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2019-01-14 02:23:40,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:40,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:40,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:40,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:40,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:40,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:40,428 INFO L82 PathProgramCache]: Analyzing trace with hash 29863753, now seen corresponding path program 1 times [2019-01-14 02:23:40,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:40,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:40,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:40,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:40,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:40,566 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-01-14 02:23:40,596 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:40,597 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:40,597 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:40,597 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:40,597 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:23:40,598 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:40,598 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:40,598 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:40,598 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:23:40,598 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:40,598 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:40,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:40,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:40,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:40,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:40,999 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:41,000 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:41,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:41,005 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:41,031 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:41,031 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:41,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:41,038 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:41,061 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:41,062 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:41,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:41,066 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:41,070 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:41,071 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 [2019-01-14 02:23:41,092 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:41,093 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 [2019-01-14 02:23:41,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:23:41,118 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:41,133 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:23:41,151 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:41,151 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:41,151 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:41,152 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:41,152 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:23:41,152 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:41,152 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:41,152 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:41,152 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:23:41,152 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:41,153 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:41,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:41,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:41,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:41,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:41,374 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:41,380 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:23:41,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:41,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:41,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:41,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:41,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:41,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:41,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:41,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:41,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:41,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:41,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:41,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:41,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:41,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:41,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:41,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:41,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:41,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:41,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:41,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:41,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:41,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:41,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:41,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:41,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:41,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:41,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:41,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:41,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:41,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:41,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:41,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:41,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:41,434 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:23:41,441 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:23:41,442 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:23:41,444 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:23:41,444 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:23:41,444 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:23:41,447 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:23:41,449 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:23:41,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:41,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:41,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:41,619 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:23:41,620 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:23:41,674 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 31 transitions. Complement of second has 5 states. [2019-01-14 02:23:41,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:23:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:23:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:23:41,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 02:23:41,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:41,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:23:41,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:41,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 8 letters. [2019-01-14 02:23:41,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:41,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 31 transitions. [2019-01-14 02:23:41,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:23:41,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 31 transitions. [2019-01-14 02:23:41,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:23:41,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 02:23:41,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2019-01-14 02:23:41,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:41,685 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-01-14 02:23:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2019-01-14 02:23:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-14 02:23:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:23:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2019-01-14 02:23:41,689 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2019-01-14 02:23:41,689 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2019-01-14 02:23:41,690 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:23:41,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2019-01-14 02:23:41,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:23:41,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:41,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:41,692 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:23:41,693 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:23:41,693 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 main_~i~0 >= 10;main_~up~0 := 0; 112#L12-2 assume !(main_~i~0 <= 0); 120#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2019-01-14 02:23:41,693 INFO L796 eck$LassoCheckResult]: Loop: 107#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 108#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 117#L12-2 assume !(main_~i~0 <= 0); 118#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2019-01-14 02:23:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:41,694 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2019-01-14 02:23:41,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:41,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:41,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:41,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:41,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:41,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:23:41,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:23:41,745 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:23:41,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:41,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1234600, now seen corresponding path program 1 times [2019-01-14 02:23:41,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:41,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:41,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:41,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:41,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:23:41,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:23:41,786 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:23:41,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:23:41,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:23:41,786 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 02:23:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:41,799 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2019-01-14 02:23:41,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:23:41,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2019-01-14 02:23:41,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 02:23:41,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 30 transitions. [2019-01-14 02:23:41,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 02:23:41,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 02:23:41,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2019-01-14 02:23:41,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:41,806 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-14 02:23:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2019-01-14 02:23:41,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-14 02:23:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 02:23:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-01-14 02:23:41,810 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-14 02:23:41,810 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-14 02:23:41,810 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:23:41,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2019-01-14 02:23:41,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:23:41,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:41,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:41,812 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:23:41,813 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:23:41,813 INFO L794 eck$LassoCheckResult]: Stem: 156#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; 157#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 161#L12 assume !(main_~i~0 >= 10); 169#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 165#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 166#L18-1 [2019-01-14 02:23:41,813 INFO L796 eck$LassoCheckResult]: Loop: 166#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 170#L12 assume !(main_~i~0 >= 10); 168#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 167#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 166#L18-1 [2019-01-14 02:23:41,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:41,813 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 1 times [2019-01-14 02:23:41,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:41,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:41,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:41,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:41,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:41,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2019-01-14 02:23:41,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:41,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:41,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:41,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:41,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:41,844 INFO L82 PathProgramCache]: Analyzing trace with hash -760725642, now seen corresponding path program 2 times [2019-01-14 02:23:41,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:41,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:41,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:41,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:41,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:41,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:23:41,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:23:41,937 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:41,937 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:41,937 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:41,937 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:41,937 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:23:41,938 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:41,938 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:41,938 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:41,938 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:23:41,938 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:41,938 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:41,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:41,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:41,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:41,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:42,346 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 02:23:42,410 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:42,410 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 [2019-01-14 02:23:42,413 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:42,414 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:42,435 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:42,435 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 [2019-01-14 02:23:42,440 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:42,440 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:42,461 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:42,461 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 [2019-01-14 02:23:42,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:42,467 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:42,473 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:42,473 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 [2019-01-14 02:23:42,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:42,496 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:42,522 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:23:42,522 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:42,537 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:23:42,555 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:42,555 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:42,555 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:42,555 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:42,555 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:23:42,555 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:42,555 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:42,556 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:42,556 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:23:42,556 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:42,556 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:42,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:42,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:42,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:42,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:42,712 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:42,712 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:23:42,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:42,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:42,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:42,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:42,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:42,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:42,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:42,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:42,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:42,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:42,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:42,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:42,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:42,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:42,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:42,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:42,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:42,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:42,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:42,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:42,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:42,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:42,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:42,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:42,745 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:23:42,748 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:23:42,749 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:23:42,749 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:23:42,749 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:23:42,749 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:23:42,750 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-01-14 02:23:42,750 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:23:42,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:42,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:42,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:42,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:42,848 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:23:42,849 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 02:23:42,935 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 36 states and 52 transitions. Complement of second has 7 states. [2019-01-14 02:23:42,937 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 [2019-01-14 02:23:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:23:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 02:23:42,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:23:42,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:42,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 02:23:42,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:42,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 02:23:42,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:42,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 52 transitions. [2019-01-14 02:23:42,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-14 02:23:42,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 50 transitions. [2019-01-14 02:23:42,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-14 02:23:42,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 02:23:42,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2019-01-14 02:23:42,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:42,944 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-01-14 02:23:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2019-01-14 02:23:42,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-01-14 02:23:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 02:23:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 45 transitions. [2019-01-14 02:23:42,950 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2019-01-14 02:23:42,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:23:42,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:23:42,951 INFO L87 Difference]: Start difference. First operand 30 states and 45 transitions. Second operand 4 states. [2019-01-14 02:23:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:42,994 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2019-01-14 02:23:42,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:23:42,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2019-01-14 02:23:42,997 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-14 02:23:42,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 40 transitions. [2019-01-14 02:23:42,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-14 02:23:42,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-14 02:23:42,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 40 transitions. [2019-01-14 02:23:42,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:43,000 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-01-14 02:23:43,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 40 transitions. [2019-01-14 02:23:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2019-01-14 02:23:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 02:23:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-01-14 02:23:43,003 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-01-14 02:23:43,003 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-01-14 02:23:43,004 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:23:43,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-01-14 02:23:43,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:23:43,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:43,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:43,006 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:23:43,006 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:23:43,006 INFO L794 eck$LassoCheckResult]: Stem: 326#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; 327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 331#L12 assume !(main_~i~0 >= 10); 338#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 337#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 328#L18-1 [2019-01-14 02:23:43,007 INFO L796 eck$LassoCheckResult]: Loop: 328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 329#L12 assume !(main_~i~0 >= 10); 322#L12-2 assume !(main_~i~0 <= 0); 323#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 328#L18-1 [2019-01-14 02:23:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 3 times [2019-01-14 02:23:43,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:43,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:43,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:43,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:43,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:43,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:43,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2019-01-14 02:23:43,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:43,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:43,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:43,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:43,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:43,028 INFO L82 PathProgramCache]: Analyzing trace with hash -760725580, now seen corresponding path program 1 times [2019-01-14 02:23:43,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:43,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:43,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:43,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:43,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:43,112 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:43,112 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:43,112 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:43,112 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:43,113 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:23:43,113 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:43,113 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:43,113 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:43,113 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:23:43,113 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:43,113 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:43,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:43,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:43,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:43,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:43,254 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:43,254 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:43,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:43,260 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:43,280 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:43,281 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 [2019-01-14 02:23:43,290 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:43,290 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:43,312 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:43,312 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 [2019-01-14 02:23:43,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:43,318 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:43,339 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:43,339 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 [2019-01-14 02:23:43,345 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:43,345 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 [2019-01-14 02:23:43,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:23:43,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:43,375 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:23:43,393 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:43,394 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:43,394 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:43,394 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:43,394 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:23:43,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:43,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:43,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:43,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:23:43,395 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:43,395 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:43,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:43,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:43,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:43,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:43,535 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:43,536 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:23:43,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:43,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:43,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:43,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:43,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:43,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:43,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:43,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:43,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:43,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:43,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:43,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:43,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:43,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:43,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:43,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:43,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:43,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:43,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:43,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:43,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:43,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:43,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:43,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:43,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:43,561 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:23:43,568 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:23:43,571 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:23:43,572 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:23:43,572 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:23:43,572 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:23:43,572 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2019-01-14 02:23:43,575 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:23:43,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:43,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:43,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:43,680 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:23:43,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-01-14 02:23:43,728 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2019-01-14 02:23:43,729 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 [2019-01-14 02:23:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:23:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-14 02:23:43,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:23:43,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:43,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 02:23:43,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:43,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 02:23:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:43,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2019-01-14 02:23:43,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:23:43,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 40 transitions. [2019-01-14 02:23:43,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 02:23:43,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 02:23:43,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2019-01-14 02:23:43,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:43,734 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-01-14 02:23:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2019-01-14 02:23:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-01-14 02:23:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 02:23:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2019-01-14 02:23:43,739 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2019-01-14 02:23:43,739 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2019-01-14 02:23:43,739 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:23:43,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2019-01-14 02:23:43,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:23:43,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:43,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:43,740 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-01-14 02:23:43,740 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:23:43,740 INFO L794 eck$LassoCheckResult]: Stem: 427#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; 428#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 440#L12 assume !(main_~i~0 >= 10); 443#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 442#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 441#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 433#L12 assume !(main_~i~0 >= 10); 423#L12-2 [2019-01-14 02:23:43,741 INFO L796 eck$LassoCheckResult]: Loop: 423#L12-2 assume !(main_~i~0 <= 0); 424#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 434#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 447#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 423#L12-2 [2019-01-14 02:23:43,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:43,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918576, now seen corresponding path program 4 times [2019-01-14 02:23:43,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:43,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:43,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:43,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:43,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 2 times [2019-01-14 02:23:43,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:43,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:43,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:43,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:43,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:43,762 INFO L82 PathProgramCache]: Analyzing trace with hash -912839815, now seen corresponding path program 1 times [2019-01-14 02:23:43,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:43,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:43,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:43,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:43,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:23:43,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:23:43,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:23:43,853 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:43,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:43,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:43,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:43,853 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:23:43,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:43,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:43,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:43,853 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:23:43,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:43,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:43,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:43,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:43,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:43,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:43,954 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:43,954 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 [2019-01-14 02:23:43,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:43,958 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:43,961 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:43,961 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 [2019-01-14 02:23:43,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:43,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:44,031 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:44,031 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 [2019-01-14 02:23:44,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:44,041 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 [2019-01-14 02:23:44,067 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:23:44,067 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:44,180 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:23:44,182 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:44,183 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:44,183 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:44,183 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:44,183 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:23:44,183 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:44,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:44,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:44,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:23:44,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:44,184 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:44,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:44,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:44,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:44,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:44,263 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:44,263 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:23:44,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:44,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:44,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:44,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:44,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:44,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:44,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:44,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:44,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:44,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:44,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:44,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:44,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:44,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:44,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:44,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:44,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:44,280 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:23:44,282 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:23:44,283 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:23:44,283 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:23:44,283 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:23:44,283 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:23:44,284 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:23:44,284 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:23:44,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:44,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:44,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:44,389 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 [2019-01-14 02:23:44,390 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-14 02:23:44,457 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 39 states and 58 transitions. Complement of second has 7 states. [2019-01-14 02:23:44,459 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 [2019-01-14 02:23:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:23:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-14 02:23:44,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:23:44,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:44,460 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:23:44,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:44,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:44,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:44,521 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 [2019-01-14 02:23:44,521 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-14 02:23:44,632 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 77 states and 108 transitions. Complement of second has 9 states. [2019-01-14 02:23:44,633 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 [2019-01-14 02:23:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:23:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 02:23:44,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:23:44,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:44,634 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:23:44,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:44,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:44,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:44,685 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 [2019-01-14 02:23:44,685 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-14 02:23:44,733 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 53 states and 81 transitions. Complement of second has 8 states. [2019-01-14 02:23:44,735 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 [2019-01-14 02:23:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:23:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-14 02:23:44,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:23:44,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:44,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 02:23:44,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:44,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 8 letters. [2019-01-14 02:23:44,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:44,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 81 transitions. [2019-01-14 02:23:44,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-01-14 02:23:44,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 42 states and 60 transitions. [2019-01-14 02:23:44,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:23:44,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-14 02:23:44,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 60 transitions. [2019-01-14 02:23:44,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:44,745 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-01-14 02:23:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 60 transitions. [2019-01-14 02:23:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-01-14 02:23:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 02:23:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-01-14 02:23:44,751 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-01-14 02:23:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:23:44,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:23:44,751 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 3 states. [2019-01-14 02:23:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:44,784 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2019-01-14 02:23:44,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:23:44,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2019-01-14 02:23:44,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:23:44,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 41 transitions. [2019-01-14 02:23:44,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 02:23:44,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:23:44,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2019-01-14 02:23:44,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:44,788 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-01-14 02:23:44,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2019-01-14 02:23:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-01-14 02:23:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 02:23:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2019-01-14 02:23:44,791 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-01-14 02:23:44,791 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-01-14 02:23:44,791 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:23:44,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 39 transitions. [2019-01-14 02:23:44,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 02:23:44,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:44,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:44,797 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-01-14 02:23:44,797 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:23:44,797 INFO L794 eck$LassoCheckResult]: Stem: 836#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; 837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 842#L12 assume !(main_~i~0 >= 10); 843#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 857#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 856#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 851#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 848#L12-2 [2019-01-14 02:23:44,797 INFO L796 eck$LassoCheckResult]: Loop: 848#L12-2 assume !(main_~i~0 <= 0); 850#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 847#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 848#L12-2 [2019-01-14 02:23:44,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:44,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918578, now seen corresponding path program 1 times [2019-01-14 02:23:44,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:44,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:44,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:44,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:44,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:44,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:23:44,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:23:44,834 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:23:44,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:44,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 3 times [2019-01-14 02:23:44,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:44,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:44,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:44,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:44,890 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:44,890 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:44,890 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:44,891 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:44,891 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:23:44,891 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:44,891 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:44,891 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:44,891 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration7_Loop [2019-01-14 02:23:44,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:44,892 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:44,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:44,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:44,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:44,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:44,999 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:44,999 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:45,003 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:45,003 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:45,007 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:45,007 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 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 [2019-01-14 02:23:45,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:45,029 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:45,049 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:45,049 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2019-01-14 02:23:45,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:45,054 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:45,074 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:45,075 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:45,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:45,079 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:45,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:23:45,103 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:45,215 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:23:45,217 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:45,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:45,217 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:45,217 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:45,217 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:23:45,217 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:45,218 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:45,218 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:45,218 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration7_Loop [2019-01-14 02:23:45,218 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:45,218 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:45,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:45,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:45,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:45,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:45,316 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:45,317 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:23:45,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:45,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:45,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:45,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:45,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:45,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:45,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:45,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:45,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:45,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:45,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:45,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:45,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:45,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:45,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:45,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:45,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:45,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:45,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:45,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:45,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:45,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:45,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:45,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:45,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:45,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:45,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:45,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:45,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:45,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:45,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:45,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:45,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:45,359 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:23:45,364 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:23:45,364 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:23:45,367 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:23:45,367 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:23:45,367 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:23:45,367 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:23:45,368 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:23:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:45,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:45,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:45,474 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 [2019-01-14 02:23:45,474 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 39 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-14 02:23:45,637 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 39 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 70 states and 94 transitions. Complement of second has 7 states. [2019-01-14 02:23:45,638 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 [2019-01-14 02:23:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:23:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-14 02:23:45,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:23:45,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:45,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 02:23:45,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:45,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2019-01-14 02:23:45,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:45,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 94 transitions. [2019-01-14 02:23:45,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 02:23:45,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 56 states and 74 transitions. [2019-01-14 02:23:45,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 02:23:45,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 02:23:45,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 74 transitions. [2019-01-14 02:23:45,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:45,644 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 74 transitions. [2019-01-14 02:23:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 74 transitions. [2019-01-14 02:23:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-01-14 02:23:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 02:23:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2019-01-14 02:23:45,648 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2019-01-14 02:23:45,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:23:45,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:23:45,648 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand 4 states. [2019-01-14 02:23:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:45,678 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2019-01-14 02:23:45,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:23:45,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 68 transitions. [2019-01-14 02:23:45,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-01-14 02:23:45,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 54 states and 66 transitions. [2019-01-14 02:23:45,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 02:23:45,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 02:23:45,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2019-01-14 02:23:45,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:45,694 INFO L706 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-01-14 02:23:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2019-01-14 02:23:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2019-01-14 02:23:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 02:23:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-01-14 02:23:45,706 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-01-14 02:23:45,706 INFO L609 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-01-14 02:23:45,706 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:23:45,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2019-01-14 02:23:45,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-01-14 02:23:45,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:45,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:45,711 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2019-01-14 02:23:45,711 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:23:45,711 INFO L794 eck$LassoCheckResult]: Stem: 1092#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; 1093#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1112#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1113#L12-2 assume !(main_~i~0 <= 0); 1103#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1104#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1098#L12 assume !(main_~i~0 >= 10); 1099#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1106#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1094#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1095#L12 assume !(main_~i~0 >= 10); 1100#L12-2 assume !(main_~i~0 <= 0); 1105#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1096#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1097#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1107#L12-2 [2019-01-14 02:23:45,711 INFO L796 eck$LassoCheckResult]: Loop: 1107#L12-2 assume !(main_~i~0 <= 0); 1108#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1129#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1127#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1107#L12-2 [2019-01-14 02:23:45,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:45,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1385122848, now seen corresponding path program 2 times [2019-01-14 02:23:45,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:45,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:45,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:45,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:45,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 02:23:45,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:45,801 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 [2019-01-14 02:23:45,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:23:45,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:23:45,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:45,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:45,832 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 02:23:45,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:45,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 02:23:45,855 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:23:45,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 4 times [2019-01-14 02:23:45,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:45,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:45,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:45,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:45,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:45,898 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:45,898 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:45,898 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:45,898 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:45,899 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:23:45,899 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:45,899 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:45,899 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:45,899 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration8_Loop [2019-01-14 02:23:45,899 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:45,900 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:45,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:45,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:45,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:45,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:46,024 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:46,024 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:46,028 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:46,028 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:46,049 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:46,049 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:46,055 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:46,055 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:46,075 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:46,075 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:46,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:46,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:46,082 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:46,082 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:46,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:46,103 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:46,128 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:23:46,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:46,240 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:23:46,241 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:46,242 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:46,242 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:46,242 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:46,242 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:23:46,242 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:46,242 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:46,242 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:46,242 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration8_Loop [2019-01-14 02:23:46,242 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:46,243 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:46,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:46,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:46,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:46,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:46,331 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:46,332 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:23:46,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:46,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:46,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:46,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:46,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:46,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:46,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:46,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:46,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:46,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:46,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:46,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:46,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:46,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:46,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:46,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:46,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:46,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:46,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:46,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:46,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:46,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:46,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:46,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:46,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:46,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:46,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:46,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:46,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:46,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:46,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:46,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:46,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:46,358 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:23:46,361 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:23:46,361 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:23:46,363 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:23:46,363 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:23:46,363 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:23:46,363 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:23:46,363 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:23:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:46,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:46,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:46,445 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 [2019-01-14 02:23:46,445 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-01-14 02:23:46,475 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 64 states and 82 transitions. Complement of second has 7 states. [2019-01-14 02:23:46,478 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 [2019-01-14 02:23:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:23:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-14 02:23:46,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-14 02:23:46,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:46,479 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:23:46,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:46,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:46,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:46,540 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 [2019-01-14 02:23:46,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-01-14 02:23:46,619 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 86 states and 103 transitions. Complement of second has 9 states. [2019-01-14 02:23:46,620 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 [2019-01-14 02:23:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:23:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 02:23:46,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-14 02:23:46,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:46,621 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:23:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:46,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:46,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:46,672 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 [2019-01-14 02:23:46,672 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-01-14 02:23:46,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 68 states and 87 transitions. Complement of second has 8 states. [2019-01-14 02:23:46,705 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 [2019-01-14 02:23:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:23:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 02:23:46,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-14 02:23:46,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:46,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 4 letters. [2019-01-14 02:23:46,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:46,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 8 letters. [2019-01-14 02:23:46,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:46,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 87 transitions. [2019-01-14 02:23:46,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-01-14 02:23:46,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 63 transitions. [2019-01-14 02:23:46,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 02:23:46,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 02:23:46,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2019-01-14 02:23:46,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:46,711 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-01-14 02:23:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2019-01-14 02:23:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2019-01-14 02:23:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 02:23:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-01-14 02:23:46,716 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-14 02:23:46,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:23:46,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:23:46,716 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 4 states. [2019-01-14 02:23:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:46,763 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-01-14 02:23:46,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:23:46,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2019-01-14 02:23:46,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-01-14 02:23:46,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 49 transitions. [2019-01-14 02:23:46,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 02:23:46,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 02:23:46,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2019-01-14 02:23:46,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:46,768 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-01-14 02:23:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2019-01-14 02:23:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2019-01-14 02:23:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 02:23:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-01-14 02:23:46,773 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-01-14 02:23:46,773 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-01-14 02:23:46,774 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:23:46,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2019-01-14 02:23:46,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-01-14 02:23:46,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:46,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:46,778 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2019-01-14 02:23:46,778 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2019-01-14 02:23:46,778 INFO L794 eck$LassoCheckResult]: Stem: 1689#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; 1690#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1691#L12 assume !(main_~i~0 >= 10); 1694#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1696#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1697#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1713#L12 assume !(main_~i~0 >= 10); 1716#L12-2 assume !(main_~i~0 <= 0); 1715#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1712#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1702#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1685#L12-2 [2019-01-14 02:23:46,778 INFO L796 eck$LassoCheckResult]: Loop: 1685#L12-2 assume !(main_~i~0 <= 0); 1686#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1698#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1719#L12 assume !(main_~i~0 >= 10); 1706#L12-2 assume !(main_~i~0 <= 0); 1711#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1704#L12 assume !(main_~i~0 >= 10); 1707#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1710#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1708#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1701#L12 assume !(main_~i~0 >= 10); 1699#L12-2 assume !(main_~i~0 <= 0); 1700#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1714#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1703#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1685#L12-2 [2019-01-14 02:23:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:46,778 INFO L82 PathProgramCache]: Analyzing trace with hash -912841737, now seen corresponding path program 1 times [2019-01-14 02:23:46,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:46,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:46,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:46,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:46,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:46,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:46,812 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 [2019-01-14 02:23:46,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:46,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:46,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:46,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 02:23:46,849 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:23:46,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:46,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1697726743, now seen corresponding path program 1 times [2019-01-14 02:23:46,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:46,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:46,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:46,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:46,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:46,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:46,887 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 [2019-01-14 02:23:46,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:46,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:46,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:46,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 02:23:46,928 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:23:46,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:23:46,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:23:46,928 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-14 02:23:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:46,971 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-01-14 02:23:46,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:23:46,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2019-01-14 02:23:46,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-14 02:23:46,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 56 transitions. [2019-01-14 02:23:46,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-14 02:23:46,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-14 02:23:46,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2019-01-14 02:23:46,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:46,976 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-01-14 02:23:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2019-01-14 02:23:46,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2019-01-14 02:23:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 02:23:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-01-14 02:23:46,981 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-01-14 02:23:46,981 INFO L609 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-01-14 02:23:46,981 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:23:46,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2019-01-14 02:23:46,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-01-14 02:23:46,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:46,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:46,982 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1] [2019-01-14 02:23:46,982 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2019-01-14 02:23:46,985 INFO L794 eck$LassoCheckResult]: Stem: 1859#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; 1860#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1876#L12 assume !(main_~i~0 >= 10); 1877#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1892#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1889#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1890#L12 assume !(main_~i~0 >= 10); 1896#L12-2 assume !(main_~i~0 <= 0); 1895#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1863#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1864#L12 assume !(main_~i~0 >= 10); 1857#L12-2 assume !(main_~i~0 <= 0); 1858#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1869#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1891#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1855#L12-2 [2019-01-14 02:23:46,985 INFO L796 eck$LassoCheckResult]: Loop: 1855#L12-2 assume !(main_~i~0 <= 0); 1856#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1886#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1884#L12 assume !(main_~i~0 >= 10); 1875#L12-2 assume !(main_~i~0 <= 0); 1881#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1878#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1873#L12 assume !(main_~i~0 >= 10); 1870#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1871#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1861#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1862#L12 assume !(main_~i~0 >= 10); 1897#L12-2 assume !(main_~i~0 <= 0); 1867#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1865#L12 assume !(main_~i~0 >= 10); 1866#L12-2 assume !(main_~i~0 <= 0); 1872#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1893#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1894#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1855#L12-2 [2019-01-14 02:23:46,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash 554461792, now seen corresponding path program 2 times [2019-01-14 02:23:46,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:46,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:46,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:46,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:46,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:47,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:47,091 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 [2019-01-14 02:23:47,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:23:47,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:23:47,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:47,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:47,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:47,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 02:23:47,145 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:23:47,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:47,146 INFO L82 PathProgramCache]: Analyzing trace with hash 104414290, now seen corresponding path program 2 times [2019-01-14 02:23:47,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:47,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:47,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:47,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:47,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:47,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:47,234 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 [2019-01-14 02:23:47,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:23:47,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:23:47,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:47,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:47,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:47,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 02:23:47,277 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:23:47,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:23:47,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:23:47,278 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 11 Second operand 6 states. [2019-01-14 02:23:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:47,318 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-01-14 02:23:47,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:23:47,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 65 transitions. [2019-01-14 02:23:47,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-01-14 02:23:47,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 64 transitions. [2019-01-14 02:23:47,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 02:23:47,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 02:23:47,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2019-01-14 02:23:47,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:47,323 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-01-14 02:23:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2019-01-14 02:23:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-01-14 02:23:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 02:23:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-01-14 02:23:47,326 INFO L729 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-01-14 02:23:47,326 INFO L609 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-01-14 02:23:47,326 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:23:47,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2019-01-14 02:23:47,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-14 02:23:47,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:47,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:47,328 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 1, 1, 1] [2019-01-14 02:23:47,328 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2019-01-14 02:23:47,328 INFO L794 eck$LassoCheckResult]: Stem: 2071#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; 2072#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2085#L12 assume !(main_~i~0 >= 10); 2086#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2101#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2098#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2099#L12 assume !(main_~i~0 >= 10); 2106#L12-2 assume !(main_~i~0 <= 0); 2107#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2111#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2109#L12 assume !(main_~i~0 >= 10); 2110#L12-2 assume !(main_~i~0 <= 0); 2079#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2075#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2076#L12 assume !(main_~i~0 >= 10); 2069#L12-2 assume !(main_~i~0 <= 0); 2070#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2102#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2100#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2067#L12-2 [2019-01-14 02:23:47,328 INFO L796 eck$LassoCheckResult]: Loop: 2067#L12-2 assume !(main_~i~0 <= 0); 2068#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2095#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2093#L12 assume !(main_~i~0 >= 10); 2084#L12-2 assume !(main_~i~0 <= 0); 2090#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2087#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2082#L12 assume !(main_~i~0 >= 10); 2080#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2078#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2073#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2074#L12 assume !(main_~i~0 >= 10); 2077#L12-2 assume !(main_~i~0 <= 0); 2081#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2117#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2116#L12 assume !(main_~i~0 >= 10); 2115#L12-2 assume !(main_~i~0 <= 0); 2114#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2113#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2112#L12 assume !(main_~i~0 >= 10); 2108#L12-2 assume !(main_~i~0 <= 0); 2105#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2103#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2104#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2067#L12-2 [2019-01-14 02:23:47,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:47,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1774824375, now seen corresponding path program 3 times [2019-01-14 02:23:47,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:47,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:47,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:47,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:47,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:47,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:47,380 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 [2019-01-14 02:23:47,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:23:47,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 02:23:47,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:47,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:47,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:47,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 02:23:47,445 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:23:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1813717701, now seen corresponding path program 3 times [2019-01-14 02:23:47,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:47,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:47,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:47,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:47,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:47,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:47,499 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 [2019-01-14 02:23:47,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:23:47,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 02:23:47,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:47,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:47,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:47,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 02:23:47,587 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:23:47,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:23:47,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:23:47,588 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-01-14 02:23:47,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:47,705 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-01-14 02:23:47,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:23:47,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2019-01-14 02:23:47,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2019-01-14 02:23:47,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 72 transitions. [2019-01-14 02:23:47,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-14 02:23:47,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-14 02:23:47,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2019-01-14 02:23:47,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:47,708 INFO L706 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2019-01-14 02:23:47,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2019-01-14 02:23:47,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2019-01-14 02:23:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 02:23:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-01-14 02:23:47,714 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-01-14 02:23:47,714 INFO L609 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-01-14 02:23:47,714 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:23:47,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 67 transitions. [2019-01-14 02:23:47,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-01-14 02:23:47,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:47,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:47,720 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1] [2019-01-14 02:23:47,720 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2019-01-14 02:23:47,720 INFO L794 eck$LassoCheckResult]: Stem: 2325#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; 2326#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2337#L12 assume !(main_~i~0 >= 10); 2338#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2356#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2353#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2354#L12 assume !(main_~i~0 >= 10); 2379#L12-2 assume !(main_~i~0 <= 0); 2378#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2329#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2330#L12 assume !(main_~i~0 >= 10); 2323#L12-2 assume !(main_~i~0 <= 0); 2324#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2377#L12 assume !(main_~i~0 >= 10); 2376#L12-2 assume !(main_~i~0 <= 0); 2375#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2358#L12 assume !(main_~i~0 >= 10); 2363#L12-2 assume !(main_~i~0 <= 0); 2361#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2357#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2355#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2321#L12-2 [2019-01-14 02:23:47,720 INFO L796 eck$LassoCheckResult]: Loop: 2321#L12-2 assume !(main_~i~0 <= 0); 2322#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2351#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2349#L12 assume !(main_~i~0 >= 10); 2341#L12-2 assume !(main_~i~0 <= 0); 2346#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2344#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2339#L12 assume !(main_~i~0 >= 10); 2335#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2336#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2328#L12 assume !(main_~i~0 >= 10); 2331#L12-2 assume !(main_~i~0 <= 0); 2332#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2333#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2373#L12 assume !(main_~i~0 >= 10); 2372#L12-2 assume !(main_~i~0 <= 0); 2371#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2370#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2369#L12 assume !(main_~i~0 >= 10); 2368#L12-2 assume !(main_~i~0 <= 0); 2367#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2366#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2365#L12 assume !(main_~i~0 >= 10); 2364#L12-2 assume !(main_~i~0 <= 0); 2362#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2359#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2360#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2321#L12-2 [2019-01-14 02:23:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:47,721 INFO L82 PathProgramCache]: Analyzing trace with hash 790045106, now seen corresponding path program 4 times [2019-01-14 02:23:47,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:47,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:47,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:47,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:47,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:47,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:47,797 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 [2019-01-14 02:23:47,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 02:23:47,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 02:23:47,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:47,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:47,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:47,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 02:23:47,864 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:23:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:47,865 INFO L82 PathProgramCache]: Analyzing trace with hash 798220708, now seen corresponding path program 4 times [2019-01-14 02:23:47,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:47,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:47,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:47,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:47,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:47,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:47,977 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 [2019-01-14 02:23:47,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 02:23:48,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 02:23:48,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:48,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:48,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:48,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 02:23:48,045 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:23:48,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:23:48,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:23:48,046 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. cyclomatic complexity: 11 Second operand 8 states. [2019-01-14 02:23:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:48,125 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-01-14 02:23:48,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:23:48,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 81 transitions. [2019-01-14 02:23:48,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-01-14 02:23:48,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 80 transitions. [2019-01-14 02:23:48,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-14 02:23:48,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-14 02:23:48,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2019-01-14 02:23:48,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:48,130 INFO L706 BuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-01-14 02:23:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2019-01-14 02:23:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2019-01-14 02:23:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 02:23:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2019-01-14 02:23:48,134 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-01-14 02:23:48,134 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-01-14 02:23:48,135 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 02:23:48,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 75 transitions. [2019-01-14 02:23:48,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-01-14 02:23:48,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:48,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:48,137 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2019-01-14 02:23:48,137 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2019-01-14 02:23:48,137 INFO L794 eck$LassoCheckResult]: Stem: 2621#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; 2622#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2633#L12 assume !(main_~i~0 >= 10); 2634#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2651#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2649#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2628#L12 assume !(main_~i~0 >= 10); 2619#L12-2 assume !(main_~i~0 <= 0); 2620#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2625#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2626#L12 assume !(main_~i~0 >= 10); 2683#L12-2 assume !(main_~i~0 <= 0); 2682#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2681#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2680#L12 assume !(main_~i~0 >= 10); 2679#L12-2 assume !(main_~i~0 <= 0); 2678#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2677#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2676#L12 assume !(main_~i~0 >= 10); 2675#L12-2 assume !(main_~i~0 <= 0); 2674#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2673#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2653#L12 assume !(main_~i~0 >= 10); 2658#L12-2 assume !(main_~i~0 <= 0); 2656#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2652#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2650#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2617#L12-2 [2019-01-14 02:23:48,137 INFO L796 eck$LassoCheckResult]: Loop: 2617#L12-2 assume !(main_~i~0 <= 0); 2618#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2647#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2645#L12 assume !(main_~i~0 >= 10); 2637#L12-2 assume !(main_~i~0 <= 0); 2642#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2640#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2635#L12 assume !(main_~i~0 >= 10); 2631#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2632#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2623#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2624#L12 assume !(main_~i~0 >= 10); 2627#L12-2 assume !(main_~i~0 <= 0); 2629#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2630#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2672#L12 assume !(main_~i~0 >= 10); 2671#L12-2 assume !(main_~i~0 <= 0); 2670#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2669#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2668#L12 assume !(main_~i~0 >= 10); 2667#L12-2 assume !(main_~i~0 <= 0); 2666#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2665#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2664#L12 assume !(main_~i~0 >= 10); 2663#L12-2 assume !(main_~i~0 <= 0); 2662#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2661#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2660#L12 assume !(main_~i~0 >= 10); 2659#L12-2 assume !(main_~i~0 <= 0); 2657#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2654#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2655#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2617#L12-2 [2019-01-14 02:23:48,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:48,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1500441957, now seen corresponding path program 5 times [2019-01-14 02:23:48,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:48,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:48,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:48,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:48,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:48,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:48,238 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 [2019-01-14 02:23:48,251 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 02:23:48,291 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 02:23:48,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:48,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:48,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:48,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 02:23:48,326 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:23:48,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:48,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1712813683, now seen corresponding path program 5 times [2019-01-14 02:23:48,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:48,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:48,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:48,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:48,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:48,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:48,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:23:48,440 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 02:23:48,452 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-14 02:23:48,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:48,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:48,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:48,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 02:23:48,484 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:23:48,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 02:23:48,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 02:23:48,485 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-01-14 02:23:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:48,599 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2019-01-14 02:23:48,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:23:48,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2019-01-14 02:23:48,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2019-01-14 02:23:48,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 88 transitions. [2019-01-14 02:23:48,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-14 02:23:48,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-14 02:23:48,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 88 transitions. [2019-01-14 02:23:48,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:48,602 INFO L706 BuchiCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-01-14 02:23:48,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 88 transitions. [2019-01-14 02:23:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2019-01-14 02:23:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-14 02:23:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-01-14 02:23:48,605 INFO L729 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-01-14 02:23:48,605 INFO L609 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-01-14 02:23:48,605 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 02:23:48,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 83 transitions. [2019-01-14 02:23:48,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2019-01-14 02:23:48,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:48,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:48,613 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 6, 1, 1, 1] [2019-01-14 02:23:48,614 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2019-01-14 02:23:48,614 INFO L794 eck$LassoCheckResult]: Stem: 2959#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; 2960#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2975#L12 assume !(main_~i~0 >= 10); 2976#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2991#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2988#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2989#L12 assume !(main_~i~0 >= 10); 3029#L12-2 assume !(main_~i~0 <= 0); 3028#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2963#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2964#L12 assume !(main_~i~0 >= 10); 2957#L12-2 assume !(main_~i~0 <= 0); 2958#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2968#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3027#L12 assume !(main_~i~0 >= 10); 3026#L12-2 assume !(main_~i~0 <= 0); 3025#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3024#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3023#L12 assume !(main_~i~0 >= 10); 3022#L12-2 assume !(main_~i~0 <= 0); 3021#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3019#L12 assume !(main_~i~0 >= 10); 3018#L12-2 assume !(main_~i~0 <= 0); 3017#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3016#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2995#L12 assume !(main_~i~0 >= 10); 2999#L12-2 assume !(main_~i~0 <= 0); 2997#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2994#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2990#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2955#L12-2 [2019-01-14 02:23:48,614 INFO L796 eck$LassoCheckResult]: Loop: 2955#L12-2 assume !(main_~i~0 <= 0); 2956#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2985#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2983#L12 assume !(main_~i~0 >= 10); 2974#L12-2 assume !(main_~i~0 <= 0); 2980#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2977#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2972#L12 assume !(main_~i~0 >= 10); 2969#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2966#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2967#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3015#L12 assume !(main_~i~0 >= 10); 2970#L12-2 assume !(main_~i~0 <= 0); 2971#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2961#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2962#L12 assume !(main_~i~0 >= 10); 2965#L12-2 assume !(main_~i~0 <= 0); 3014#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3013#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3012#L12 assume !(main_~i~0 >= 10); 3011#L12-2 assume !(main_~i~0 <= 0); 3010#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3009#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3008#L12 assume !(main_~i~0 >= 10); 3007#L12-2 assume !(main_~i~0 <= 0); 3006#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3005#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3004#L12 assume !(main_~i~0 >= 10); 3003#L12-2 assume !(main_~i~0 <= 0); 3002#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3001#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3000#L12 assume !(main_~i~0 >= 10); 2998#L12-2 assume !(main_~i~0 <= 0); 2996#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2992#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2993#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2955#L12-2 [2019-01-14 02:23:48,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:48,614 INFO L82 PathProgramCache]: Analyzing trace with hash -60397820, now seen corresponding path program 6 times [2019-01-14 02:23:48,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:48,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:48,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:48,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:48,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:48,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:48,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:23:48,799 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 02:23:48,818 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 02:23:48,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:48,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:48,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:48,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 02:23:48,862 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:23:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash -127593226, now seen corresponding path program 6 times [2019-01-14 02:23:48,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:48,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:48,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:49,148 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:49,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:49,149 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 [2019-01-14 02:23:49,159 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 02:23:49,173 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-14 02:23:49,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:49,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:49,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:49,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 02:23:49,204 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:23:49,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:23:49,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:23:49,205 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-01-14 02:23:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:49,560 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-01-14 02:23:49,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:23:49,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 97 transitions. [2019-01-14 02:23:49,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2019-01-14 02:23:49,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 88 states and 96 transitions. [2019-01-14 02:23:49,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-01-14 02:23:49,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-14 02:23:49,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 96 transitions. [2019-01-14 02:23:49,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:49,563 INFO L706 BuchiCegarLoop]: Abstraction has 88 states and 96 transitions. [2019-01-14 02:23:49,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 96 transitions. [2019-01-14 02:23:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-01-14 02:23:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-14 02:23:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2019-01-14 02:23:49,566 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2019-01-14 02:23:49,566 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2019-01-14 02:23:49,566 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 02:23:49,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 91 transitions. [2019-01-14 02:23:49,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2019-01-14 02:23:49,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:49,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:49,568 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 1, 1, 1] [2019-01-14 02:23:49,568 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2019-01-14 02:23:49,568 INFO L794 eck$LassoCheckResult]: Stem: 3339#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; 3340#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3352#L12 assume !(main_~i~0 >= 10); 3353#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3371#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3368#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3369#L12 assume !(main_~i~0 >= 10); 3417#L12-2 assume !(main_~i~0 <= 0); 3416#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3343#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3344#L12 assume !(main_~i~0 >= 10); 3337#L12-2 assume !(main_~i~0 <= 0); 3338#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3348#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3415#L12 assume !(main_~i~0 >= 10); 3414#L12-2 assume !(main_~i~0 <= 0); 3413#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3411#L12 assume !(main_~i~0 >= 10); 3410#L12-2 assume !(main_~i~0 <= 0); 3409#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3407#L12 assume !(main_~i~0 >= 10); 3406#L12-2 assume !(main_~i~0 <= 0); 3405#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3404#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3403#L12 assume !(main_~i~0 >= 10); 3402#L12-2 assume !(main_~i~0 <= 0); 3401#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3400#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3375#L12 assume !(main_~i~0 >= 10); 3379#L12-2 assume !(main_~i~0 <= 0); 3377#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3370#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3335#L12-2 [2019-01-14 02:23:49,568 INFO L796 eck$LassoCheckResult]: Loop: 3335#L12-2 assume !(main_~i~0 <= 0); 3336#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3366#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3364#L12 assume !(main_~i~0 >= 10); 3356#L12-2 assume !(main_~i~0 <= 0); 3361#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3359#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3354#L12 assume !(main_~i~0 >= 10); 3349#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3346#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3347#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3399#L12 assume !(main_~i~0 >= 10); 3350#L12-2 assume !(main_~i~0 <= 0); 3351#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3341#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3342#L12 assume !(main_~i~0 >= 10); 3345#L12-2 assume !(main_~i~0 <= 0); 3398#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3397#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3396#L12 assume !(main_~i~0 >= 10); 3395#L12-2 assume !(main_~i~0 <= 0); 3394#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3393#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3392#L12 assume !(main_~i~0 >= 10); 3391#L12-2 assume !(main_~i~0 <= 0); 3390#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3389#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3388#L12 assume !(main_~i~0 >= 10); 3387#L12-2 assume !(main_~i~0 <= 0); 3386#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3385#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3384#L12 assume !(main_~i~0 >= 10); 3383#L12-2 assume !(main_~i~0 <= 0); 3382#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3381#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3380#L12 assume !(main_~i~0 >= 10); 3378#L12-2 assume !(main_~i~0 <= 0); 3376#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3372#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3373#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3335#L12-2 [2019-01-14 02:23:49,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:49,569 INFO L82 PathProgramCache]: Analyzing trace with hash 87645933, now seen corresponding path program 7 times [2019-01-14 02:23:49,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:49,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:49,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:49,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:49,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:49,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:49,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:23:49,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:49,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:49,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:49,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 02:23:49,776 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:23:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:49,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1701561311, now seen corresponding path program 7 times [2019-01-14 02:23:49,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:49,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:49,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:49,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:49,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:50,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:50,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:23:50,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:50,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:50,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:50,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 02:23:50,986 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:23:50,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 02:23:50,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 02:23:50,987 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. cyclomatic complexity: 11 Second operand 11 states. [2019-01-14 02:23:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:51,123 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2019-01-14 02:23:51,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:23:51,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 105 transitions. [2019-01-14 02:23:51,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-01-14 02:23:51,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 96 states and 104 transitions. [2019-01-14 02:23:51,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2019-01-14 02:23:51,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-01-14 02:23:51,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 104 transitions. [2019-01-14 02:23:51,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:51,128 INFO L706 BuchiCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-01-14 02:23:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 104 transitions. [2019-01-14 02:23:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-01-14 02:23:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-14 02:23:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2019-01-14 02:23:51,131 INFO L729 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-01-14 02:23:51,131 INFO L609 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-01-14 02:23:51,131 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-14 02:23:51,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 99 transitions. [2019-01-14 02:23:51,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2019-01-14 02:23:51,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:51,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:51,134 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 1, 1, 1] [2019-01-14 02:23:51,134 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2019-01-14 02:23:51,134 INFO L794 eck$LassoCheckResult]: Stem: 3761#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; 3762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3776#L12 assume !(main_~i~0 >= 10); 3777#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3791#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3768#L12 assume !(main_~i~0 >= 10); 3759#L12-2 assume !(main_~i~0 <= 0); 3760#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3766#L12 assume !(main_~i~0 >= 10); 3847#L12-2 assume !(main_~i~0 <= 0); 3846#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3844#L12 assume !(main_~i~0 >= 10); 3843#L12-2 assume !(main_~i~0 <= 0); 3842#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3840#L12 assume !(main_~i~0 >= 10); 3839#L12-2 assume !(main_~i~0 <= 0); 3838#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3836#L12 assume !(main_~i~0 >= 10); 3835#L12-2 assume !(main_~i~0 <= 0); 3834#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3833#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3832#L12 assume !(main_~i~0 >= 10); 3831#L12-2 assume !(main_~i~0 <= 0); 3830#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3829#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3828#L12 assume !(main_~i~0 >= 10); 3827#L12-2 assume !(main_~i~0 <= 0); 3826#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3825#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3793#L12 assume !(main_~i~0 >= 10); 3798#L12-2 assume !(main_~i~0 <= 0); 3796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3792#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3790#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3757#L12-2 [2019-01-14 02:23:51,134 INFO L796 eck$LassoCheckResult]: Loop: 3757#L12-2 assume !(main_~i~0 <= 0); 3758#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3784#L12 assume !(main_~i~0 >= 10); 3775#L12-2 assume !(main_~i~0 <= 0); 3781#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3773#L12 assume !(main_~i~0 >= 10); 3771#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3772#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3763#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3764#L12 assume !(main_~i~0 >= 10); 3767#L12-2 assume !(main_~i~0 <= 0); 3769#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3824#L12 assume !(main_~i~0 >= 10); 3823#L12-2 assume !(main_~i~0 <= 0); 3822#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3821#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3820#L12 assume !(main_~i~0 >= 10); 3819#L12-2 assume !(main_~i~0 <= 0); 3818#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3817#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3816#L12 assume !(main_~i~0 >= 10); 3815#L12-2 assume !(main_~i~0 <= 0); 3814#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3813#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3812#L12 assume !(main_~i~0 >= 10); 3811#L12-2 assume !(main_~i~0 <= 0); 3810#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3809#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3808#L12 assume !(main_~i~0 >= 10); 3807#L12-2 assume !(main_~i~0 <= 0); 3806#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3804#L12 assume !(main_~i~0 >= 10); 3803#L12-2 assume !(main_~i~0 <= 0); 3802#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3801#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3800#L12 assume !(main_~i~0 >= 10); 3799#L12-2 assume !(main_~i~0 <= 0); 3797#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3794#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3795#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3757#L12-2 [2019-01-14 02:23:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:51,135 INFO L82 PathProgramCache]: Analyzing trace with hash -91473322, now seen corresponding path program 8 times [2019-01-14 02:23:51,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:51,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:51,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:51,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:51,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:51,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:51,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:23:51,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:23:51,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:23:51,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:51,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:23:51,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:51,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-14 02:23:51,438 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:23:51,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:51,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2143365560, now seen corresponding path program 8 times [2019-01-14 02:23:51,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:51,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:51,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:51,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:51,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:51,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:51,770 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 [2019-01-14 02:23:51,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:23:51,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:23:51,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:51,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:23:51,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:51,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-14 02:23:51,824 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:23:51,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 02:23:51,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 02:23:51,825 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. cyclomatic complexity: 11 Second operand 12 states. [2019-01-14 02:23:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:51,997 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2019-01-14 02:23:52,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 02:23:52,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 215 transitions. [2019-01-14 02:23:52,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-01-14 02:23:52,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 190 states and 211 transitions. [2019-01-14 02:23:52,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-01-14 02:23:52,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2019-01-14 02:23:52,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 211 transitions. [2019-01-14 02:23:52,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:52,010 INFO L706 BuchiCegarLoop]: Abstraction has 190 states and 211 transitions. [2019-01-14 02:23:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 211 transitions. [2019-01-14 02:23:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2019-01-14 02:23:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-14 02:23:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2019-01-14 02:23:52,014 INFO L729 BuchiCegarLoop]: Abstraction has 163 states and 184 transitions. [2019-01-14 02:23:52,014 INFO L609 BuchiCegarLoop]: Abstraction has 163 states and 184 transitions. [2019-01-14 02:23:52,014 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-14 02:23:52,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 184 transitions. [2019-01-14 02:23:52,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:23:52,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:52,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:52,019 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-01-14 02:23:52,019 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2019-01-14 02:23:52,019 INFO L794 eck$LassoCheckResult]: Stem: 4314#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; 4315#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4317#L12 assume !(main_~i~0 >= 10); 4409#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4408#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4407#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4322#L12 assume !(main_~i~0 >= 10); 4323#L12-2 assume !(main_~i~0 <= 0); 4406#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4319#L12 assume !(main_~i~0 >= 10); 4312#L12-2 assume !(main_~i~0 <= 0); 4313#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4405#L12 assume !(main_~i~0 >= 10); 4404#L12-2 assume !(main_~i~0 <= 0); 4403#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4402#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4401#L12 assume !(main_~i~0 >= 10); 4400#L12-2 assume !(main_~i~0 <= 0); 4399#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4398#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4397#L12 assume !(main_~i~0 >= 10); 4396#L12-2 assume !(main_~i~0 <= 0); 4395#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4394#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4393#L12 assume !(main_~i~0 >= 10); 4392#L12-2 assume !(main_~i~0 <= 0); 4391#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4390#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4389#L12 assume !(main_~i~0 >= 10); 4388#L12-2 assume !(main_~i~0 <= 0); 4387#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4386#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4385#L12 assume !(main_~i~0 >= 10); 4384#L12-2 assume !(main_~i~0 <= 0); 4383#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4382#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4339#L12 assume !(main_~i~0 >= 10); 4343#L12-2 assume !(main_~i~0 <= 0); 4341#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4332#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4331#L12-2 [2019-01-14 02:23:52,019 INFO L796 eck$LassoCheckResult]: Loop: 4331#L12-2 assume !(main_~i~0 <= 0); 4326#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4333#L12 assume !(main_~i~0 >= 10); 4335#L12-2 assume !(main_~i~0 <= 0); 4472#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4412#L12 assume !(main_~i~0 >= 10); 4379#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4378#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4377#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4376#L12 assume !(main_~i~0 >= 10); 4375#L12-2 assume !(main_~i~0 <= 0); 4374#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4373#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4372#L12 assume !(main_~i~0 >= 10); 4371#L12-2 assume !(main_~i~0 <= 0); 4370#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4369#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4368#L12 assume !(main_~i~0 >= 10); 4367#L12-2 assume !(main_~i~0 <= 0); 4366#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4365#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4364#L12 assume !(main_~i~0 >= 10); 4363#L12-2 assume !(main_~i~0 <= 0); 4362#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4361#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4360#L12 assume !(main_~i~0 >= 10); 4359#L12-2 assume !(main_~i~0 <= 0); 4358#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4357#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4356#L12 assume !(main_~i~0 >= 10); 4355#L12-2 assume !(main_~i~0 <= 0); 4354#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4353#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4352#L12 assume !(main_~i~0 >= 10); 4351#L12-2 assume !(main_~i~0 <= 0); 4350#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4349#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4348#L12 assume !(main_~i~0 >= 10); 4347#L12-2 assume !(main_~i~0 <= 0); 4346#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4345#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4344#L12 assume !(main_~i~0 >= 10); 4342#L12-2 assume !(main_~i~0 <= 0); 4340#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4336#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4337#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4331#L12-2 [2019-01-14 02:23:52,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:52,019 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 9 times [2019-01-14 02:23:52,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:52,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:52,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:52,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:52,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:52,053 INFO L82 PathProgramCache]: Analyzing trace with hash -50295759, now seen corresponding path program 9 times [2019-01-14 02:23:52,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:52,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:52,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:52,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1470164625, now seen corresponding path program 3 times [2019-01-14 02:23:52,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:52,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:52,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 591 proven. 6 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:23:52,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:52,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:23:52,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:23:52,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-14 02:23:52,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:52,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 752 proven. 10 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-01-14 02:23:52,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:52,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 13 [2019-01-14 02:23:52,556 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2019-01-14 02:23:52,567 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:52,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:52,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:52,567 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:52,567 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:23:52,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:52,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:52,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:52,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration17_Loop [2019-01-14 02:23:52,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:52,568 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:52,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:52,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:52,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:52,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:52,664 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:52,666 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2019-01-14 02:23:52,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:52,670 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:52,691 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:52,691 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 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 [2019-01-14 02:23:52,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:52,698 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:52,720 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:52,721 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=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 [2019-01-14 02:23:52,725 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:52,726 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 [2019-01-14 02:23:52,767 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:23:52,767 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:52,792 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:23:52,793 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:52,793 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:52,793 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:52,793 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:52,794 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:23:52,794 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:52,794 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:52,794 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:52,794 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration17_Loop [2019-01-14 02:23:52,794 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:52,794 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:52,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:52,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:52,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:52,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:52,908 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:52,908 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:23:52,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:52,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:52,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:52,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:52,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:52,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:52,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:52,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:52,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:52,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:52,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:52,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:52,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:52,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:52,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:52,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:52,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:52,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:52,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:52,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:52,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:52,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:52,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:52,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:52,927 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:23:52,928 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:23:52,928 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:23:52,929 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:23:52,929 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:23:52,929 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:23:52,929 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 6 Supporting invariants [] [2019-01-14 02:23:52,929 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:23:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:53,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:53,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-14 02:23:53,084 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 [2019-01-14 02:23:53,086 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 184 transitions. cyclomatic complexity: 24 Second operand 6 states. [2019-01-14 02:23:53,261 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 184 transitions. cyclomatic complexity: 24. Second operand 6 states. Result 473 states and 516 transitions. Complement of second has 15 states. [2019-01-14 02:23:53,263 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 [2019-01-14 02:23:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:23:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2019-01-14 02:23:53,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 48 letters. [2019-01-14 02:23:53,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:53,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 91 letters. Loop has 48 letters. [2019-01-14 02:23:53,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:53,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 96 letters. [2019-01-14 02:23:53,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:53,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 473 states and 516 transitions. [2019-01-14 02:23:53,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-01-14 02:23:53,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 473 states to 431 states and 474 transitions. [2019-01-14 02:23:53,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2019-01-14 02:23:53,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2019-01-14 02:23:53,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 431 states and 474 transitions. [2019-01-14 02:23:53,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:53,277 INFO L706 BuchiCegarLoop]: Abstraction has 431 states and 474 transitions. [2019-01-14 02:23:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states and 474 transitions. [2019-01-14 02:23:53,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 409. [2019-01-14 02:23:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-01-14 02:23:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 450 transitions. [2019-01-14 02:23:53,286 INFO L729 BuchiCegarLoop]: Abstraction has 409 states and 450 transitions. [2019-01-14 02:23:53,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 02:23:53,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 02:23:53,286 INFO L87 Difference]: Start difference. First operand 409 states and 450 transitions. Second operand 13 states. [2019-01-14 02:23:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:53,348 INFO L93 Difference]: Finished difference Result 274 states and 305 transitions. [2019-01-14 02:23:53,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:23:53,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 305 transitions. [2019-01-14 02:23:53,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:23:53,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 255 states and 286 transitions. [2019-01-14 02:23:53,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-01-14 02:23:53,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-01-14 02:23:53,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 286 transitions. [2019-01-14 02:23:53,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:53,357 INFO L706 BuchiCegarLoop]: Abstraction has 255 states and 286 transitions. [2019-01-14 02:23:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 286 transitions. [2019-01-14 02:23:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 167. [2019-01-14 02:23:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-14 02:23:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 188 transitions. [2019-01-14 02:23:53,361 INFO L729 BuchiCegarLoop]: Abstraction has 167 states and 188 transitions. [2019-01-14 02:23:53,361 INFO L609 BuchiCegarLoop]: Abstraction has 167 states and 188 transitions. [2019-01-14 02:23:53,361 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-14 02:23:53,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 188 transitions. [2019-01-14 02:23:53,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:23:53,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:53,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:53,364 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-01-14 02:23:53,364 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] [2019-01-14 02:23:53,364 INFO L794 eck$LassoCheckResult]: Stem: 6228#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; 6229#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6243#L12 assume !(main_~i~0 >= 10); 6320#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6319#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6234#L12 assume !(main_~i~0 >= 10); 6226#L12-2 assume !(main_~i~0 <= 0); 6227#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6232#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6233#L12 assume !(main_~i~0 >= 10); 6317#L12-2 assume !(main_~i~0 <= 0); 6236#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6237#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6316#L12 assume !(main_~i~0 >= 10); 6315#L12-2 assume !(main_~i~0 <= 0); 6314#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6312#L12 assume !(main_~i~0 >= 10); 6311#L12-2 assume !(main_~i~0 <= 0); 6310#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6308#L12 assume !(main_~i~0 >= 10); 6307#L12-2 assume !(main_~i~0 <= 0); 6306#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6304#L12 assume !(main_~i~0 >= 10); 6303#L12-2 assume !(main_~i~0 <= 0); 6302#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6300#L12 assume !(main_~i~0 >= 10); 6299#L12-2 assume !(main_~i~0 <= 0); 6298#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6296#L12 assume !(main_~i~0 >= 10); 6295#L12-2 assume !(main_~i~0 <= 0); 6294#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6293#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6249#L12 assume !(main_~i~0 >= 10); 6292#L12-2 assume !(main_~i~0 <= 0); 6291#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6248#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6247#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6246#L12-2 [2019-01-14 02:23:53,365 INFO L796 eck$LassoCheckResult]: Loop: 6246#L12-2 assume !(main_~i~0 <= 0); 6244#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6241#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6242#L12 assume !(main_~i~0 >= 10); 6326#L12-2 assume !(main_~i~0 <= 0); 6324#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6330#L12 assume !(main_~i~0 >= 10); 6331#L12-2 assume !(main_~i~0 <= 0); 6327#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6322#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6323#L12 assume !(main_~i~0 >= 10); 6289#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6288#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6286#L12 assume !(main_~i~0 >= 10); 6285#L12-2 assume !(main_~i~0 <= 0); 6284#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6282#L12 assume !(main_~i~0 >= 10); 6281#L12-2 assume !(main_~i~0 <= 0); 6280#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6278#L12 assume !(main_~i~0 >= 10); 6277#L12-2 assume !(main_~i~0 <= 0); 6276#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6275#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6274#L12 assume !(main_~i~0 >= 10); 6273#L12-2 assume !(main_~i~0 <= 0); 6272#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6270#L12 assume !(main_~i~0 >= 10); 6269#L12-2 assume !(main_~i~0 <= 0); 6268#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6267#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6266#L12 assume !(main_~i~0 >= 10); 6265#L12-2 assume !(main_~i~0 <= 0); 6264#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6263#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6262#L12 assume !(main_~i~0 >= 10); 6261#L12-2 assume !(main_~i~0 <= 0); 6260#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6259#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6258#L12 assume !(main_~i~0 >= 10); 6257#L12-2 assume !(main_~i~0 <= 0); 6256#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6254#L12 assume !(main_~i~0 >= 10); 6253#L12-2 assume !(main_~i~0 <= 0); 6252#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6250#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6251#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6246#L12-2 [2019-01-14 02:23:53,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:53,365 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 10 times [2019-01-14 02:23:53,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:53,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:53,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:53,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:53,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:53,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:53,380 INFO L82 PathProgramCache]: Analyzing trace with hash -690818020, now seen corresponding path program 10 times [2019-01-14 02:23:53,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:53,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:53,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:53,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:53,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:53,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:53,402 INFO L82 PathProgramCache]: Analyzing trace with hash -120542630, now seen corresponding path program 4 times [2019-01-14 02:23:53,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:53,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:53,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:53,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:53,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:23:53,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:53,676 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 [2019-01-14 02:23:53,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 02:23:53,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 02:23:53,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:53,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:23:53,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:53,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 02:23:54,049 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 55 [2019-01-14 02:23:54,084 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:54,084 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:54,084 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:54,085 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:54,085 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:23:54,085 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:54,085 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:54,085 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:54,085 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration18_Loop [2019-01-14 02:23:54,086 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:54,086 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:54,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:54,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:54,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:54,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:54,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:54,156 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 [2019-01-14 02:23:54,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:54,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:54,183 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:54,183 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:23:54,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:54,190 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-14 02:23:54,216 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:23:54,216 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:54,220 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:23:54,238 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:54,238 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:54,238 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:54,238 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:54,238 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:23:54,238 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:54,238 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:54,239 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:54,239 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration18_Loop [2019-01-14 02:23:54,239 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:54,239 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:54,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:54,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:54,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:54,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:54,316 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:54,316 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:23:54,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:54,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:54,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:54,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:54,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:54,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:54,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:54,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:54,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:54,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:54,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:54,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:54,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:54,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:54,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:54,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:54,337 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:23:54,339 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:23:54,339 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:23:54,339 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:23:54,339 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:23:54,340 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:23:54,340 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 Supporting invariants [] [2019-01-14 02:23:54,340 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:23:54,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:54,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:54,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-14 02:23:54,648 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 [2019-01-14 02:23:54,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 167 states and 188 transitions. cyclomatic complexity: 24 Second operand 7 states. [2019-01-14 02:23:55,372 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 167 states and 188 transitions. cyclomatic complexity: 24. Second operand 7 states. Result 529 states and 572 transitions. Complement of second has 19 states. [2019-01-14 02:23:55,373 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 [2019-01-14 02:23:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:23:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2019-01-14 02:23:55,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 52 letters. [2019-01-14 02:23:55,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:55,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 95 letters. Loop has 52 letters. [2019-01-14 02:23:55,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:55,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 104 letters. [2019-01-14 02:23:55,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:55,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 529 states and 572 transitions. [2019-01-14 02:23:55,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-01-14 02:23:55,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 529 states to 459 states and 502 transitions. [2019-01-14 02:23:55,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2019-01-14 02:23:55,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2019-01-14 02:23:55,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 502 transitions. [2019-01-14 02:23:55,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:55,389 INFO L706 BuchiCegarLoop]: Abstraction has 459 states and 502 transitions. [2019-01-14 02:23:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 502 transitions. [2019-01-14 02:23:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-01-14 02:23:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-01-14 02:23:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 456 transitions. [2019-01-14 02:23:55,402 INFO L729 BuchiCegarLoop]: Abstraction has 417 states and 456 transitions. [2019-01-14 02:23:55,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:23:55,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:23:55,403 INFO L87 Difference]: Start difference. First operand 417 states and 456 transitions. Second operand 6 states. [2019-01-14 02:23:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:55,494 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2019-01-14 02:23:55,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:23:55,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 319 transitions. [2019-01-14 02:23:55,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:23:55,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 263 states and 292 transitions. [2019-01-14 02:23:55,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2019-01-14 02:23:55,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2019-01-14 02:23:55,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 292 transitions. [2019-01-14 02:23:55,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:55,500 INFO L706 BuchiCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-01-14 02:23:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 292 transitions. [2019-01-14 02:23:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 171. [2019-01-14 02:23:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-14 02:23:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 191 transitions. [2019-01-14 02:23:55,504 INFO L729 BuchiCegarLoop]: Abstraction has 171 states and 191 transitions. [2019-01-14 02:23:55,504 INFO L609 BuchiCegarLoop]: Abstraction has 171 states and 191 transitions. [2019-01-14 02:23:55,504 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-14 02:23:55,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 191 transitions. [2019-01-14 02:23:55,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:23:55,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:55,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:55,507 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-01-14 02:23:55,507 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2019-01-14 02:23:55,507 INFO L794 eck$LassoCheckResult]: Stem: 8251#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; 8252#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8266#L12 assume !(main_~i~0 >= 10); 8344#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 8343#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8342#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8257#L12 assume !(main_~i~0 >= 10); 8249#L12-2 assume !(main_~i~0 <= 0); 8250#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8256#L12 assume !(main_~i~0 >= 10); 8341#L12-2 assume !(main_~i~0 <= 0); 8259#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8340#L12 assume !(main_~i~0 >= 10); 8339#L12-2 assume !(main_~i~0 <= 0); 8338#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8337#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8336#L12 assume !(main_~i~0 >= 10); 8335#L12-2 assume !(main_~i~0 <= 0); 8334#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8333#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8332#L12 assume !(main_~i~0 >= 10); 8331#L12-2 assume !(main_~i~0 <= 0); 8330#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8329#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8328#L12 assume !(main_~i~0 >= 10); 8327#L12-2 assume !(main_~i~0 <= 0); 8326#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8324#L12 assume !(main_~i~0 >= 10); 8323#L12-2 assume !(main_~i~0 <= 0); 8322#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8321#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8320#L12 assume !(main_~i~0 >= 10); 8319#L12-2 assume !(main_~i~0 <= 0); 8318#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8275#L12 assume !(main_~i~0 >= 10); 8316#L12-2 assume !(main_~i~0 <= 0); 8315#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8271#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 8269#L12-2 [2019-01-14 02:23:55,507 INFO L796 eck$LassoCheckResult]: Loop: 8269#L12-2 assume !(main_~i~0 <= 0); 8267#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8381#L12 assume !(main_~i~0 >= 10); 8380#L12-2 assume !(main_~i~0 <= 0); 8379#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8378#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8377#L12 assume !(main_~i~0 >= 10); 8376#L12-2 assume !(main_~i~0 <= 0); 8375#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8351#L12 assume !(main_~i~0 >= 10); 8350#L12-2 assume !(main_~i~0 <= 0); 8348#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8349#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8352#L12 assume !(main_~i~0 >= 10); 8313#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 8312#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8311#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8310#L12 assume !(main_~i~0 >= 10); 8309#L12-2 assume !(main_~i~0 <= 0); 8308#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8307#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8306#L12 assume !(main_~i~0 >= 10); 8305#L12-2 assume !(main_~i~0 <= 0); 8304#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8303#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8302#L12 assume !(main_~i~0 >= 10); 8301#L12-2 assume !(main_~i~0 <= 0); 8300#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8299#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8298#L12 assume !(main_~i~0 >= 10); 8297#L12-2 assume !(main_~i~0 <= 0); 8296#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8295#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8294#L12 assume !(main_~i~0 >= 10); 8293#L12-2 assume !(main_~i~0 <= 0); 8292#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8290#L12 assume !(main_~i~0 >= 10); 8289#L12-2 assume !(main_~i~0 <= 0); 8288#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8286#L12 assume !(main_~i~0 >= 10); 8285#L12-2 assume !(main_~i~0 <= 0); 8284#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8282#L12 assume !(main_~i~0 >= 10); 8281#L12-2 assume !(main_~i~0 <= 0); 8280#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8278#L12 assume !(main_~i~0 >= 10); 8277#L12-2 assume !(main_~i~0 <= 0); 8276#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8272#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8273#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 8269#L12-2 [2019-01-14 02:23:55,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:55,508 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 11 times [2019-01-14 02:23:55,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:55,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:55,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:55,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:55,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:55,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 805924487, now seen corresponding path program 11 times [2019-01-14 02:23:55,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:55,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:55,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:55,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:55,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:55,543 INFO L82 PathProgramCache]: Analyzing trace with hash 329635269, now seen corresponding path program 5 times [2019-01-14 02:23:55,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:55,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:55,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:55,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:23:55,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:55,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:23:55,762 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 02:23:55,781 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-14 02:23:55,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:55,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:23:55,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:55,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 02:23:56,165 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 58 [2019-01-14 02:23:56,184 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:56,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:56,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:56,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:56,185 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:23:56,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:56,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:56,185 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:56,185 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration19_Loop [2019-01-14 02:23:56,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:56,185 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:56,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:56,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:56,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:56,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:56,252 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:56,252 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2019-01-14 02:23:56,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:56,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:56,278 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:56,278 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:56,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:56,285 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-14 02:23:56,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:23:56,311 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:56,314 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:23:56,332 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:56,332 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:56,332 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:56,333 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:56,333 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:23:56,333 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:56,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:56,333 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:56,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration19_Loop [2019-01-14 02:23:56,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:56,333 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:56,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:56,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:56,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:56,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:56,397 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:56,397 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:23:56,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:56,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:56,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:56,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:56,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:56,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:56,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:56,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:56,403 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:23:56,404 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:23:56,405 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:23:56,410 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:23:56,410 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:23:56,411 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:23:56,411 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2019-01-14 02:23:56,411 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:23:56,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:56,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:56,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-14 02:23:56,538 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 [2019-01-14 02:23:56,538 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 191 transitions. cyclomatic complexity: 23 Second operand 8 states. [2019-01-14 02:23:56,832 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 191 transitions. cyclomatic complexity: 23. Second operand 8 states. Result 601 states and 644 transitions. Complement of second has 23 states. [2019-01-14 02:23:56,834 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 [2019-01-14 02:23:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:23:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2019-01-14 02:23:56,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 56 letters. [2019-01-14 02:23:56,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:56,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 99 letters. Loop has 56 letters. [2019-01-14 02:23:56,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:56,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 112 letters. [2019-01-14 02:23:56,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:56,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 601 states and 644 transitions. [2019-01-14 02:23:56,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-01-14 02:23:56,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 601 states to 495 states and 538 transitions. [2019-01-14 02:23:56,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 247 [2019-01-14 02:23:56,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 [2019-01-14 02:23:56,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 538 transitions. [2019-01-14 02:23:56,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:56,850 INFO L706 BuchiCegarLoop]: Abstraction has 495 states and 538 transitions. [2019-01-14 02:23:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 538 transitions. [2019-01-14 02:23:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 425. [2019-01-14 02:23:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-01-14 02:23:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 462 transitions. [2019-01-14 02:23:56,862 INFO L729 BuchiCegarLoop]: Abstraction has 425 states and 462 transitions. [2019-01-14 02:23:56,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:23:56,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:23:56,862 INFO L87 Difference]: Start difference. First operand 425 states and 462 transitions. Second operand 7 states. [2019-01-14 02:23:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:56,986 INFO L93 Difference]: Finished difference Result 306 states and 333 transitions. [2019-01-14 02:23:56,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:23:56,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 306 states and 333 transitions. [2019-01-14 02:23:56,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:23:56,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 306 states to 271 states and 298 transitions. [2019-01-14 02:23:56,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2019-01-14 02:23:56,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2019-01-14 02:23:56,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 298 transitions. [2019-01-14 02:23:56,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:56,993 INFO L706 BuchiCegarLoop]: Abstraction has 271 states and 298 transitions. [2019-01-14 02:23:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 298 transitions. [2019-01-14 02:23:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 175. [2019-01-14 02:23:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-14 02:23:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 194 transitions. [2019-01-14 02:23:57,000 INFO L729 BuchiCegarLoop]: Abstraction has 175 states and 194 transitions. [2019-01-14 02:23:57,000 INFO L609 BuchiCegarLoop]: Abstraction has 175 states and 194 transitions. [2019-01-14 02:23:57,000 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2019-01-14 02:23:57,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 194 transitions. [2019-01-14 02:23:57,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:23:57,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:57,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:57,005 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-01-14 02:23:57,005 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] [2019-01-14 02:23:57,005 INFO L794 eck$LassoCheckResult]: Stem: 10407#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; 10408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10421#L12 assume !(main_~i~0 >= 10); 10501#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10500#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10499#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10498#L12 assume !(main_~i~0 >= 10); 10405#L12-2 assume !(main_~i~0 <= 0); 10406#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10412#L12 assume !(main_~i~0 >= 10); 10415#L12-2 assume !(main_~i~0 <= 0); 10417#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10418#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10497#L12 assume !(main_~i~0 >= 10); 10496#L12-2 assume !(main_~i~0 <= 0); 10495#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10493#L12 assume !(main_~i~0 >= 10); 10492#L12-2 assume !(main_~i~0 <= 0); 10491#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10489#L12 assume !(main_~i~0 >= 10); 10488#L12-2 assume !(main_~i~0 <= 0); 10487#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10486#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10485#L12 assume !(main_~i~0 >= 10); 10484#L12-2 assume !(main_~i~0 <= 0); 10483#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10481#L12 assume !(main_~i~0 >= 10); 10480#L12-2 assume !(main_~i~0 <= 0); 10479#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10477#L12 assume !(main_~i~0 >= 10); 10476#L12-2 assume !(main_~i~0 <= 0); 10475#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10432#L12 assume !(main_~i~0 >= 10); 10473#L12-2 assume !(main_~i~0 <= 0); 10472#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10428#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 10427#L12-2 [2019-01-14 02:23:57,005 INFO L796 eck$LassoCheckResult]: Loop: 10427#L12-2 assume !(main_~i~0 <= 0); 10424#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10425#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10538#L12 assume !(main_~i~0 >= 10); 10537#L12-2 assume !(main_~i~0 <= 0); 10536#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10535#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10534#L12 assume !(main_~i~0 >= 10); 10533#L12-2 assume !(main_~i~0 <= 0); 10532#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10531#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10530#L12 assume !(main_~i~0 >= 10); 10529#L12-2 assume !(main_~i~0 <= 0); 10528#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10527#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10508#L12 assume !(main_~i~0 >= 10); 10507#L12-2 assume !(main_~i~0 <= 0); 10505#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10506#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10509#L12 assume !(main_~i~0 >= 10); 10470#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10469#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10468#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10467#L12 assume !(main_~i~0 >= 10); 10466#L12-2 assume !(main_~i~0 <= 0); 10465#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10464#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10463#L12 assume !(main_~i~0 >= 10); 10462#L12-2 assume !(main_~i~0 <= 0); 10461#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10460#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10459#L12 assume !(main_~i~0 >= 10); 10458#L12-2 assume !(main_~i~0 <= 0); 10457#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10456#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10455#L12 assume !(main_~i~0 >= 10); 10454#L12-2 assume !(main_~i~0 <= 0); 10453#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10452#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10451#L12 assume !(main_~i~0 >= 10); 10450#L12-2 assume !(main_~i~0 <= 0); 10449#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10448#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10447#L12 assume !(main_~i~0 >= 10); 10446#L12-2 assume !(main_~i~0 <= 0); 10445#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10444#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10443#L12 assume !(main_~i~0 >= 10); 10442#L12-2 assume !(main_~i~0 <= 0); 10441#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10440#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10439#L12 assume !(main_~i~0 >= 10); 10438#L12-2 assume !(main_~i~0 <= 0); 10437#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10436#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10435#L12 assume !(main_~i~0 >= 10); 10434#L12-2 assume !(main_~i~0 <= 0); 10433#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10429#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10430#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 10427#L12-2 [2019-01-14 02:23:57,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:57,006 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 12 times [2019-01-14 02:23:57,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:57,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:57,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:57,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:57,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:57,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1151943822, now seen corresponding path program 12 times [2019-01-14 02:23:57,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:57,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:57,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:57,052 INFO L82 PathProgramCache]: Analyzing trace with hash 533812144, now seen corresponding path program 6 times [2019-01-14 02:23:57,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:57,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:57,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:57,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:57,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:23:57,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:57,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:23:57,338 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 02:23:57,380 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2019-01-14 02:23:57,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:23:57,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:23:57,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:57,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 02:23:57,786 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 60 [2019-01-14 02:23:57,797 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:57,797 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:57,797 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:57,797 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:57,797 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:23:57,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:57,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:57,798 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:57,798 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration20_Loop [2019-01-14 02:23:57,798 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:57,798 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:57,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:57,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:57,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:57,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:57,888 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:57,890 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2019-01-14 02:23:57,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:57,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:57,898 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:57,898 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 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:57,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:57,921 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-14 02:23:57,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:23:57,945 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:58,055 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:23:58,057 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:58,057 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:58,057 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:58,057 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:58,057 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:23:58,057 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:58,057 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:58,057 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:58,058 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration20_Loop [2019-01-14 02:23:58,058 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:58,058 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:58,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:58,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:58,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:58,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:58,127 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:58,127 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:23:58,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:58,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:58,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:58,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:58,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:58,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:23:58,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:23:58,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:58,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:58,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:58,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:58,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:58,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:58,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:58,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:58,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:58,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:23:58,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:23:58,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:23:58,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:23:58,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:23:58,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:23:58,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:23:58,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:23:58,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:23:58,137 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:23:58,139 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:23:58,139 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:23:58,140 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:23:58,140 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:23:58,140 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:23:58,140 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 15 Supporting invariants [] [2019-01-14 02:23:58,140 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:23:58,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:58,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:58,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-14 02:23:58,554 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 [2019-01-14 02:23:58,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 194 transitions. cyclomatic complexity: 22 Second operand 9 states. [2019-01-14 02:23:59,023 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 194 transitions. cyclomatic complexity: 22. Second operand 9 states. Result 689 states and 732 transitions. Complement of second has 27 states. [2019-01-14 02:23:59,024 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 [2019-01-14 02:23:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:23:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2019-01-14 02:23:59,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 60 letters. [2019-01-14 02:23:59,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:59,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 103 letters. Loop has 60 letters. [2019-01-14 02:23:59,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:59,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 120 letters. [2019-01-14 02:23:59,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:23:59,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 689 states and 732 transitions. [2019-01-14 02:23:59,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-01-14 02:23:59,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 689 states to 539 states and 582 transitions. [2019-01-14 02:23:59,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279 [2019-01-14 02:23:59,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2019-01-14 02:23:59,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 539 states and 582 transitions. [2019-01-14 02:23:59,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:59,036 INFO L706 BuchiCegarLoop]: Abstraction has 539 states and 582 transitions. [2019-01-14 02:23:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states and 582 transitions. [2019-01-14 02:23:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 433. [2019-01-14 02:23:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-01-14 02:23:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 468 transitions. [2019-01-14 02:23:59,043 INFO L729 BuchiCegarLoop]: Abstraction has 433 states and 468 transitions. [2019-01-14 02:23:59,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:23:59,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:23:59,044 INFO L87 Difference]: Start difference. First operand 433 states and 468 transitions. Second operand 8 states. [2019-01-14 02:23:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:23:59,150 INFO L93 Difference]: Finished difference Result 322 states and 347 transitions. [2019-01-14 02:23:59,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:23:59,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 322 states and 347 transitions. [2019-01-14 02:23:59,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:23:59,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 322 states to 279 states and 304 transitions. [2019-01-14 02:23:59,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2019-01-14 02:23:59,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2019-01-14 02:23:59,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 304 transitions. [2019-01-14 02:23:59,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:23:59,158 INFO L706 BuchiCegarLoop]: Abstraction has 279 states and 304 transitions. [2019-01-14 02:23:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 304 transitions. [2019-01-14 02:23:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 179. [2019-01-14 02:23:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-14 02:23:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-01-14 02:23:59,161 INFO L729 BuchiCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-01-14 02:23:59,161 INFO L609 BuchiCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-01-14 02:23:59,161 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2019-01-14 02:23:59,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 197 transitions. [2019-01-14 02:23:59,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:23:59,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:23:59,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:23:59,164 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-01-14 02:23:59,164 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2019-01-14 02:23:59,164 INFO L794 eck$LassoCheckResult]: Stem: 12712#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; 12713#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12728#L12 assume !(main_~i~0 >= 10); 12806#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 12805#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12804#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12720#L12 assume !(main_~i~0 >= 10); 12721#L12-2 assume !(main_~i~0 <= 0); 12803#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12716#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12717#L12 assume !(main_~i~0 >= 10); 12710#L12-2 assume !(main_~i~0 <= 0); 12711#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12723#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12802#L12 assume !(main_~i~0 >= 10); 12801#L12-2 assume !(main_~i~0 <= 0); 12800#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12799#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12798#L12 assume !(main_~i~0 >= 10); 12797#L12-2 assume !(main_~i~0 <= 0); 12796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12795#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12794#L12 assume !(main_~i~0 >= 10); 12793#L12-2 assume !(main_~i~0 <= 0); 12792#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12791#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12790#L12 assume !(main_~i~0 >= 10); 12789#L12-2 assume !(main_~i~0 <= 0); 12788#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12787#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12786#L12 assume !(main_~i~0 >= 10); 12785#L12-2 assume !(main_~i~0 <= 0); 12784#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12783#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12782#L12 assume !(main_~i~0 >= 10); 12781#L12-2 assume !(main_~i~0 <= 0); 12780#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12779#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12737#L12 assume !(main_~i~0 >= 10); 12778#L12-2 assume !(main_~i~0 <= 0); 12777#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12736#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12733#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 12731#L12-2 [2019-01-14 02:23:59,164 INFO L796 eck$LassoCheckResult]: Loop: 12731#L12-2 assume !(main_~i~0 <= 0); 12729#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12730#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12843#L12 assume !(main_~i~0 >= 10); 12842#L12-2 assume !(main_~i~0 <= 0); 12841#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12840#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12839#L12 assume !(main_~i~0 >= 10); 12838#L12-2 assume !(main_~i~0 <= 0); 12837#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12836#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12835#L12 assume !(main_~i~0 >= 10); 12834#L12-2 assume !(main_~i~0 <= 0); 12833#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12832#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12831#L12 assume !(main_~i~0 >= 10); 12830#L12-2 assume !(main_~i~0 <= 0); 12829#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12828#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12813#L12 assume !(main_~i~0 >= 10); 12814#L12-2 assume !(main_~i~0 <= 0); 12810#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12808#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12809#L12 assume !(main_~i~0 >= 10); 12775#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 12774#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12772#L12 assume !(main_~i~0 >= 10); 12771#L12-2 assume !(main_~i~0 <= 0); 12770#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12769#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12768#L12 assume !(main_~i~0 >= 10); 12767#L12-2 assume !(main_~i~0 <= 0); 12766#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12764#L12 assume !(main_~i~0 >= 10); 12763#L12-2 assume !(main_~i~0 <= 0); 12762#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12761#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12760#L12 assume !(main_~i~0 >= 10); 12759#L12-2 assume !(main_~i~0 <= 0); 12758#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12756#L12 assume !(main_~i~0 >= 10); 12755#L12-2 assume !(main_~i~0 <= 0); 12754#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12753#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12752#L12 assume !(main_~i~0 >= 10); 12751#L12-2 assume !(main_~i~0 <= 0); 12750#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12749#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12748#L12 assume !(main_~i~0 >= 10); 12747#L12-2 assume !(main_~i~0 <= 0); 12746#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12745#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12744#L12 assume !(main_~i~0 >= 10); 12743#L12-2 assume !(main_~i~0 <= 0); 12742#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12741#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12740#L12 assume !(main_~i~0 >= 10); 12739#L12-2 assume !(main_~i~0 <= 0); 12738#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12734#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12735#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 12731#L12-2 [2019-01-14 02:23:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 13 times [2019-01-14 02:23:59,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:59,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:59,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:59,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:23:59,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash 336435933, now seen corresponding path program 13 times [2019-01-14 02:23:59,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:59,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:23:59,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:23:59,206 INFO L82 PathProgramCache]: Analyzing trace with hash 216392731, now seen corresponding path program 7 times [2019-01-14 02:23:59,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:23:59,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:23:59,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:59,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:59,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:23:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:23:59,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:23:59,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:23:59,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:23:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:23:59,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:23:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:23:59,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:23:59,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 02:23:59,801 WARN L181 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 65 [2019-01-14 02:23:59,811 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:23:59,811 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:23:59,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:23:59,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:23:59,812 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:23:59,812 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:59,812 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:23:59,812 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:23:59,813 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration21_Loop [2019-01-14 02:23:59,813 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:23:59,813 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:23:59,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:59,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:59,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:59,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:23:59,884 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:23:59,884 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:59,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:59,891 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:23:59,911 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:23:59,911 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 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:23:59,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:23:59,921 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-14 02:23:59,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:23:59,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:24:00,065 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:24:00,068 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:24:00,068 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:24:00,068 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:24:00,068 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:24:00,068 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:24:00,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:00,069 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:24:00,069 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:24:00,069 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration21_Loop [2019-01-14 02:24:00,069 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:24:00,069 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:24:00,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:00,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:00,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:00,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:00,141 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:24:00,141 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:24:00,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:00,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:00,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:00,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:00,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:00,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:00,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:00,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:00,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:00,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:00,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:00,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:00,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:00,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:00,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:00,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:00,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:00,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:00,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:00,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:00,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:00,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:00,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:00,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:00,151 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:24:00,151 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:24:00,152 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:24:00,152 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:24:00,152 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:24:00,152 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:24:00,152 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 8 Supporting invariants [] [2019-01-14 02:24:00,153 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:24:00,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:00,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:00,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-14 02:24:00,286 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 [2019-01-14 02:24:00,287 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 197 transitions. cyclomatic complexity: 21 Second operand 10 states. [2019-01-14 02:24:00,758 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 197 transitions. cyclomatic complexity: 21. Second operand 10 states. Result 793 states and 836 transitions. Complement of second has 31 states. [2019-01-14 02:24:00,761 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 [2019-01-14 02:24:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:24:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2019-01-14 02:24:00,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 64 letters. [2019-01-14 02:24:00,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:00,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 107 letters. Loop has 64 letters. [2019-01-14 02:24:00,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:00,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 128 letters. [2019-01-14 02:24:00,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:00,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 793 states and 836 transitions. [2019-01-14 02:24:00,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-01-14 02:24:00,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 793 states to 591 states and 634 transitions. [2019-01-14 02:24:00,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 319 [2019-01-14 02:24:00,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 323 [2019-01-14 02:24:00,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 591 states and 634 transitions. [2019-01-14 02:24:00,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:24:00,785 INFO L706 BuchiCegarLoop]: Abstraction has 591 states and 634 transitions. [2019-01-14 02:24:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states and 634 transitions. [2019-01-14 02:24:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 441. [2019-01-14 02:24:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-01-14 02:24:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 474 transitions. [2019-01-14 02:24:00,802 INFO L729 BuchiCegarLoop]: Abstraction has 441 states and 474 transitions. [2019-01-14 02:24:00,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 02:24:00,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 02:24:00,803 INFO L87 Difference]: Start difference. First operand 441 states and 474 transitions. Second operand 9 states. [2019-01-14 02:24:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:24:01,268 INFO L93 Difference]: Finished difference Result 338 states and 361 transitions. [2019-01-14 02:24:01,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:24:01,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 361 transitions. [2019-01-14 02:24:01,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:24:01,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 287 states and 310 transitions. [2019-01-14 02:24:01,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2019-01-14 02:24:01,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2019-01-14 02:24:01,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 310 transitions. [2019-01-14 02:24:01,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:24:01,277 INFO L706 BuchiCegarLoop]: Abstraction has 287 states and 310 transitions. [2019-01-14 02:24:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 310 transitions. [2019-01-14 02:24:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 183. [2019-01-14 02:24:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-14 02:24:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 200 transitions. [2019-01-14 02:24:01,286 INFO L729 BuchiCegarLoop]: Abstraction has 183 states and 200 transitions. [2019-01-14 02:24:01,286 INFO L609 BuchiCegarLoop]: Abstraction has 183 states and 200 transitions. [2019-01-14 02:24:01,286 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2019-01-14 02:24:01,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 200 transitions. [2019-01-14 02:24:01,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:24:01,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:24:01,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:24:01,294 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-01-14 02:24:01,294 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] [2019-01-14 02:24:01,294 INFO L794 eck$LassoCheckResult]: Stem: 15182#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; 15183#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15198#L12 assume !(main_~i~0 >= 10); 15276#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 15275#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15190#L12 assume !(main_~i~0 >= 10); 15180#L12-2 assume !(main_~i~0 <= 0); 15181#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15186#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15187#L12 assume !(main_~i~0 >= 10); 15273#L12-2 assume !(main_~i~0 <= 0); 15192#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15193#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15272#L12 assume !(main_~i~0 >= 10); 15271#L12-2 assume !(main_~i~0 <= 0); 15270#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15269#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15268#L12 assume !(main_~i~0 >= 10); 15267#L12-2 assume !(main_~i~0 <= 0); 15266#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15265#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15264#L12 assume !(main_~i~0 >= 10); 15263#L12-2 assume !(main_~i~0 <= 0); 15262#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15261#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15260#L12 assume !(main_~i~0 >= 10); 15259#L12-2 assume !(main_~i~0 <= 0); 15258#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15257#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15256#L12 assume !(main_~i~0 >= 10); 15255#L12-2 assume !(main_~i~0 <= 0); 15254#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15253#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15252#L12 assume !(main_~i~0 >= 10); 15251#L12-2 assume !(main_~i~0 <= 0); 15250#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15249#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15205#L12 assume !(main_~i~0 >= 10); 15248#L12-2 assume !(main_~i~0 <= 0); 15247#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15204#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15203#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 15201#L12-2 [2019-01-14 02:24:01,294 INFO L796 eck$LassoCheckResult]: Loop: 15201#L12-2 assume !(main_~i~0 <= 0); 15199#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15200#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15313#L12 assume !(main_~i~0 >= 10); 15312#L12-2 assume !(main_~i~0 <= 0); 15311#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15310#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15309#L12 assume !(main_~i~0 >= 10); 15308#L12-2 assume !(main_~i~0 <= 0); 15307#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15306#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15305#L12 assume !(main_~i~0 >= 10); 15304#L12-2 assume !(main_~i~0 <= 0); 15303#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15302#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15301#L12 assume !(main_~i~0 >= 10); 15300#L12-2 assume !(main_~i~0 <= 0); 15299#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15298#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15297#L12 assume !(main_~i~0 >= 10); 15296#L12-2 assume !(main_~i~0 <= 0); 15295#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15294#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15283#L12 assume !(main_~i~0 >= 10); 15282#L12-2 assume !(main_~i~0 <= 0); 15280#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15281#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15284#L12 assume !(main_~i~0 >= 10); 15245#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 15244#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15242#L12 assume !(main_~i~0 >= 10); 15241#L12-2 assume !(main_~i~0 <= 0); 15240#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15239#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15238#L12 assume !(main_~i~0 >= 10); 15237#L12-2 assume !(main_~i~0 <= 0); 15236#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15235#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15234#L12 assume !(main_~i~0 >= 10); 15233#L12-2 assume !(main_~i~0 <= 0); 15232#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15231#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15230#L12 assume !(main_~i~0 >= 10); 15229#L12-2 assume !(main_~i~0 <= 0); 15228#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15227#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15226#L12 assume !(main_~i~0 >= 10); 15225#L12-2 assume !(main_~i~0 <= 0); 15224#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15223#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15222#L12 assume !(main_~i~0 >= 10); 15221#L12-2 assume !(main_~i~0 <= 0); 15220#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15219#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15218#L12 assume !(main_~i~0 >= 10); 15217#L12-2 assume !(main_~i~0 <= 0); 15216#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15215#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15214#L12 assume !(main_~i~0 >= 10); 15213#L12-2 assume !(main_~i~0 <= 0); 15212#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15211#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15210#L12 assume !(main_~i~0 >= 10); 15209#L12-2 assume !(main_~i~0 <= 0); 15208#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15206#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15207#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 15201#L12-2 [2019-01-14 02:24:01,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:01,295 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 14 times [2019-01-14 02:24:01,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:01,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:01,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:01,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:01,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:01,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1847643336, now seen corresponding path program 14 times [2019-01-14 02:24:01,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:01,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:01,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:01,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:24:01,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:01,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:01,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1125533446, now seen corresponding path program 8 times [2019-01-14 02:24:01,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:01,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:24:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:24:01,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:24:01,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:24:01,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:24:01,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:24:01,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:24:01,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:24:01,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:24:01,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 02:24:02,033 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 68 [2019-01-14 02:24:02,050 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:24:02,050 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:24:02,050 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:24:02,051 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:24:02,051 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:24:02,051 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:02,051 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:24:02,051 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:24:02,051 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration22_Loop [2019-01-14 02:24:02,052 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:24:02,052 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:24:02,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:02,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:02,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:02,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:02,128 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:24:02,128 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2019-01-14 02:24:02,135 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:24:02,135 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-14 02:24:02,159 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:24:02,160 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:24:02,163 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:24:02,181 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:24:02,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:24:02,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:24:02,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:24:02,182 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:24:02,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:02,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:24:02,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:24:02,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration22_Loop [2019-01-14 02:24:02,182 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:24:02,182 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:24:02,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:02,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:02,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:02,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:02,266 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:24:02,266 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:24:02,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:02,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:02,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:02,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:02,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:02,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:02,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:02,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:02,271 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:24:02,272 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:24:02,272 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:24:02,272 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:24:02,272 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:24:02,272 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:24:02,272 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2019-01-14 02:24:02,273 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:24:02,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:02,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:02,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 373 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-14 02:24:02,581 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 [2019-01-14 02:24:02,581 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 183 states and 200 transitions. cyclomatic complexity: 20 Second operand 11 states. [2019-01-14 02:24:03,667 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 183 states and 200 transitions. cyclomatic complexity: 20. Second operand 11 states. Result 913 states and 956 transitions. Complement of second has 35 states. [2019-01-14 02:24:03,669 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 [2019-01-14 02:24:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:24:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2019-01-14 02:24:03,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 68 letters. [2019-01-14 02:24:03,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:03,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 111 letters. Loop has 68 letters. [2019-01-14 02:24:03,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:03,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 136 letters. [2019-01-14 02:24:03,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:03,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 956 transitions. [2019-01-14 02:24:03,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-01-14 02:24:03,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 651 states and 694 transitions. [2019-01-14 02:24:03,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2019-01-14 02:24:03,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2019-01-14 02:24:03,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 651 states and 694 transitions. [2019-01-14 02:24:03,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:24:03,683 INFO L706 BuchiCegarLoop]: Abstraction has 651 states and 694 transitions. [2019-01-14 02:24:03,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states and 694 transitions. [2019-01-14 02:24:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 449. [2019-01-14 02:24:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-01-14 02:24:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 480 transitions. [2019-01-14 02:24:03,690 INFO L729 BuchiCegarLoop]: Abstraction has 449 states and 480 transitions. [2019-01-14 02:24:03,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:24:03,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:24:03,691 INFO L87 Difference]: Start difference. First operand 449 states and 480 transitions. Second operand 10 states. [2019-01-14 02:24:04,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:24:04,127 INFO L93 Difference]: Finished difference Result 354 states and 375 transitions. [2019-01-14 02:24:04,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:24:04,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 375 transitions. [2019-01-14 02:24:04,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:24:04,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 295 states and 316 transitions. [2019-01-14 02:24:04,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2019-01-14 02:24:04,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 207 [2019-01-14 02:24:04,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 316 transitions. [2019-01-14 02:24:04,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:24:04,137 INFO L706 BuchiCegarLoop]: Abstraction has 295 states and 316 transitions. [2019-01-14 02:24:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 316 transitions. [2019-01-14 02:24:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 187. [2019-01-14 02:24:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-14 02:24:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 203 transitions. [2019-01-14 02:24:04,147 INFO L729 BuchiCegarLoop]: Abstraction has 187 states and 203 transitions. [2019-01-14 02:24:04,147 INFO L609 BuchiCegarLoop]: Abstraction has 187 states and 203 transitions. [2019-01-14 02:24:04,148 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2019-01-14 02:24:04,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 203 transitions. [2019-01-14 02:24:04,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:24:04,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:24:04,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:24:04,149 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-01-14 02:24:04,150 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2019-01-14 02:24:04,154 INFO L794 eck$LassoCheckResult]: Stem: 17833#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; 17834#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17847#L12 assume !(main_~i~0 >= 10); 17931#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 17930#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17929#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17928#L12 assume !(main_~i~0 >= 10); 17831#L12-2 assume !(main_~i~0 <= 0); 17832#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17838#L12 assume !(main_~i~0 >= 10); 17840#L12-2 assume !(main_~i~0 <= 0); 17925#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17922#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17921#L12 assume !(main_~i~0 >= 10); 17920#L12-2 assume !(main_~i~0 <= 0); 17919#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17918#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17917#L12 assume !(main_~i~0 >= 10); 17916#L12-2 assume !(main_~i~0 <= 0); 17915#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17914#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17913#L12 assume !(main_~i~0 >= 10); 17912#L12-2 assume !(main_~i~0 <= 0); 17911#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17910#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17909#L12 assume !(main_~i~0 >= 10); 17908#L12-2 assume !(main_~i~0 <= 0); 17907#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17906#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17905#L12 assume !(main_~i~0 >= 10); 17904#L12-2 assume !(main_~i~0 <= 0); 17903#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17901#L12 assume !(main_~i~0 >= 10); 17900#L12-2 assume !(main_~i~0 <= 0); 17899#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17898#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17856#L12 assume !(main_~i~0 >= 10); 17897#L12-2 assume !(main_~i~0 <= 0); 17896#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17855#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17852#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 17850#L12-2 [2019-01-14 02:24:04,154 INFO L796 eck$LassoCheckResult]: Loop: 17850#L12-2 assume !(main_~i~0 <= 0); 17848#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17964#L12 assume !(main_~i~0 >= 10); 17963#L12-2 assume !(main_~i~0 <= 0); 17962#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17961#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17960#L12 assume !(main_~i~0 >= 10); 17959#L12-2 assume !(main_~i~0 <= 0); 17958#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17957#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17956#L12 assume !(main_~i~0 >= 10); 17955#L12-2 assume !(main_~i~0 <= 0); 17954#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17953#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17952#L12 assume !(main_~i~0 >= 10); 17951#L12-2 assume !(main_~i~0 <= 0); 17950#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17949#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17948#L12 assume !(main_~i~0 >= 10); 17947#L12-2 assume !(main_~i~0 <= 0); 17946#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17945#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17944#L12 assume !(main_~i~0 >= 10); 17943#L12-2 assume !(main_~i~0 <= 0); 17942#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17941#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17935#L12 assume !(main_~i~0 >= 10); 17936#L12-2 assume !(main_~i~0 <= 0); 17926#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17927#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17937#L12 assume !(main_~i~0 >= 10); 17894#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 17893#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17892#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17891#L12 assume !(main_~i~0 >= 10); 17890#L12-2 assume !(main_~i~0 <= 0); 17889#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17888#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17887#L12 assume !(main_~i~0 >= 10); 17886#L12-2 assume !(main_~i~0 <= 0); 17885#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17884#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17883#L12 assume !(main_~i~0 >= 10); 17882#L12-2 assume !(main_~i~0 <= 0); 17881#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17880#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17879#L12 assume !(main_~i~0 >= 10); 17878#L12-2 assume !(main_~i~0 <= 0); 17877#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17876#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17875#L12 assume !(main_~i~0 >= 10); 17874#L12-2 assume !(main_~i~0 <= 0); 17873#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17872#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17871#L12 assume !(main_~i~0 >= 10); 17870#L12-2 assume !(main_~i~0 <= 0); 17869#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17867#L12 assume !(main_~i~0 >= 10); 17866#L12-2 assume !(main_~i~0 <= 0); 17865#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17864#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17863#L12 assume !(main_~i~0 >= 10); 17862#L12-2 assume !(main_~i~0 <= 0); 17861#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17860#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17859#L12 assume !(main_~i~0 >= 10); 17858#L12-2 assume !(main_~i~0 <= 0); 17857#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17854#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 17850#L12-2 [2019-01-14 02:24:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 15 times [2019-01-14 02:24:04,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:04,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:04,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:24:04,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:04,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1176703283, now seen corresponding path program 15 times [2019-01-14 02:24:04,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:04,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:04,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:24:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:04,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:04,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1395997809, now seen corresponding path program 9 times [2019-01-14 02:24:04,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:04,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:04,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:04,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:24:04,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1077 proven. 120 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:24:04,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:24:04,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:24:04,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:24:04,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-14 02:24:04,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:24:04,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1112 proven. 226 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2019-01-14 02:24:04,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:24:04,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2019-01-14 02:24:04,973 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 69 [2019-01-14 02:24:04,984 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:24:04,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:24:04,985 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:24:04,985 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:24:04,985 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:24:04,985 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:04,986 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:24:04,986 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:24:04,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration23_Loop [2019-01-14 02:24:04,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:24:04,986 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:24:04,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:04,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:05,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:05,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:05,112 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:24:05,112 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:05,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:24:05,136 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:24:05,140 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:24:05,140 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 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 [2019-01-14 02:24:05,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:24:05,160 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:24:05,180 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:24:05,181 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 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 [2019-01-14 02:24:05,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:24:05,186 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:24:05,206 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:24:05,206 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 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 [2019-01-14 02:24:05,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:24:05,212 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-14 02:24:05,235 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:24:05,235 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:24:05,239 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:24:05,256 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:24:05,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:24:05,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:24:05,257 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:24:05,257 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:24:05,257 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:05,257 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:24:05,257 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:24:05,257 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration23_Loop [2019-01-14 02:24:05,257 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:24:05,257 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:24:05,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:05,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:05,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:05,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:05,337 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:24:05,337 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:24:05,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:05,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:05,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:05,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:05,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:05,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:05,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:05,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:05,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:05,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:05,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:05,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:05,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:05,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:05,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:05,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:05,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:05,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:05,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:05,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:05,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:05,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:05,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:05,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:05,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:05,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:05,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:05,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:05,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:05,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:05,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:05,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:05,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:05,348 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:24:05,348 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:24:05,349 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:24:05,349 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:24:05,349 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:24:05,349 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:24:05,349 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2019-01-14 02:24:05,350 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:24:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:05,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:05,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-14 02:24:05,545 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 [2019-01-14 02:24:05,545 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 203 transitions. cyclomatic complexity: 19 Second operand 12 states. [2019-01-14 02:24:06,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 203 transitions. cyclomatic complexity: 19. Second operand 12 states. Result 1050 states and 1093 transitions. Complement of second has 39 states. [2019-01-14 02:24:06,563 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 [2019-01-14 02:24:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:24:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2019-01-14 02:24:06,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 72 letters. [2019-01-14 02:24:06,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:06,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 115 letters. Loop has 72 letters. [2019-01-14 02:24:06,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:06,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 144 letters. [2019-01-14 02:24:06,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:06,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1050 states and 1093 transitions. [2019-01-14 02:24:06,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-01-14 02:24:06,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1050 states to 720 states and 763 transitions. [2019-01-14 02:24:06,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 423 [2019-01-14 02:24:06,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2019-01-14 02:24:06,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 720 states and 763 transitions. [2019-01-14 02:24:06,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:24:06,582 INFO L706 BuchiCegarLoop]: Abstraction has 720 states and 763 transitions. [2019-01-14 02:24:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states and 763 transitions. [2019-01-14 02:24:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 457. [2019-01-14 02:24:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-01-14 02:24:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 486 transitions. [2019-01-14 02:24:06,595 INFO L729 BuchiCegarLoop]: Abstraction has 457 states and 486 transitions. [2019-01-14 02:24:06,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 02:24:06,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 02:24:06,600 INFO L87 Difference]: Start difference. First operand 457 states and 486 transitions. Second operand 13 states. [2019-01-14 02:24:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:24:06,956 INFO L93 Difference]: Finished difference Result 370 states and 389 transitions. [2019-01-14 02:24:06,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:24:06,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 389 transitions. [2019-01-14 02:24:06,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:24:06,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 303 states and 322 transitions. [2019-01-14 02:24:06,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2019-01-14 02:24:06,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2019-01-14 02:24:06,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 322 transitions. [2019-01-14 02:24:06,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:24:06,967 INFO L706 BuchiCegarLoop]: Abstraction has 303 states and 322 transitions. [2019-01-14 02:24:06,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 322 transitions. [2019-01-14 02:24:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 191. [2019-01-14 02:24:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-14 02:24:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2019-01-14 02:24:06,977 INFO L729 BuchiCegarLoop]: Abstraction has 191 states and 206 transitions. [2019-01-14 02:24:06,977 INFO L609 BuchiCegarLoop]: Abstraction has 191 states and 206 transitions. [2019-01-14 02:24:06,977 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2019-01-14 02:24:06,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 206 transitions. [2019-01-14 02:24:06,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:24:06,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:24:06,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:24:06,979 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-01-14 02:24:06,979 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] [2019-01-14 02:24:06,980 INFO L794 eck$LassoCheckResult]: Stem: 20684#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; 20685#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20695#L12 assume !(main_~i~0 >= 10); 20812#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 20810#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20808#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20806#L12 assume !(main_~i~0 >= 10); 20804#L12-2 assume !(main_~i~0 <= 0); 20803#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20688#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20689#L12 assume !(main_~i~0 >= 10); 20682#L12-2 assume !(main_~i~0 <= 0); 20683#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20691#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20800#L12 assume !(main_~i~0 >= 10); 20798#L12-2 assume !(main_~i~0 <= 0); 20796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20794#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20792#L12 assume !(main_~i~0 >= 10); 20790#L12-2 assume !(main_~i~0 <= 0); 20788#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20784#L12 assume !(main_~i~0 >= 10); 20782#L12-2 assume !(main_~i~0 <= 0); 20780#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20776#L12 assume !(main_~i~0 >= 10); 20774#L12-2 assume !(main_~i~0 <= 0); 20772#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20768#L12 assume !(main_~i~0 >= 10); 20766#L12-2 assume !(main_~i~0 <= 0); 20764#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20760#L12 assume !(main_~i~0 >= 10); 20758#L12-2 assume !(main_~i~0 <= 0); 20756#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20753#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20705#L12 assume !(main_~i~0 >= 10); 20748#L12-2 assume !(main_~i~0 <= 0); 20745#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20704#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20701#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 20698#L12-2 [2019-01-14 02:24:06,983 INFO L796 eck$LassoCheckResult]: Loop: 20698#L12-2 assume !(main_~i~0 <= 0); 20699#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20813#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20811#L12 assume !(main_~i~0 >= 10); 20809#L12-2 assume !(main_~i~0 <= 0); 20807#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20802#L12 assume !(main_~i~0 >= 10); 20801#L12-2 assume !(main_~i~0 <= 0); 20799#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20797#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20795#L12 assume !(main_~i~0 >= 10); 20793#L12-2 assume !(main_~i~0 <= 0); 20791#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20787#L12 assume !(main_~i~0 >= 10); 20785#L12-2 assume !(main_~i~0 <= 0); 20783#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20781#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20779#L12 assume !(main_~i~0 >= 10); 20777#L12-2 assume !(main_~i~0 <= 0); 20775#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20771#L12 assume !(main_~i~0 >= 10); 20769#L12-2 assume !(main_~i~0 <= 0); 20767#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20763#L12 assume !(main_~i~0 >= 10); 20761#L12-2 assume !(main_~i~0 <= 0); 20759#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20754#L12 assume !(main_~i~0 >= 10); 20751#L12-2 assume !(main_~i~0 <= 0); 20752#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20746#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20747#L12 assume !(main_~i~0 >= 10); 20743#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 20742#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20741#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20740#L12 assume !(main_~i~0 >= 10); 20739#L12-2 assume !(main_~i~0 <= 0); 20738#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20737#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20736#L12 assume !(main_~i~0 >= 10); 20735#L12-2 assume !(main_~i~0 <= 0); 20734#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20733#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20732#L12 assume !(main_~i~0 >= 10); 20731#L12-2 assume !(main_~i~0 <= 0); 20730#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20729#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20728#L12 assume !(main_~i~0 >= 10); 20727#L12-2 assume !(main_~i~0 <= 0); 20726#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20725#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20724#L12 assume !(main_~i~0 >= 10); 20723#L12-2 assume !(main_~i~0 <= 0); 20722#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20721#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20720#L12 assume !(main_~i~0 >= 10); 20719#L12-2 assume !(main_~i~0 <= 0); 20718#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20717#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20716#L12 assume !(main_~i~0 >= 10); 20715#L12-2 assume !(main_~i~0 <= 0); 20714#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20713#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20712#L12 assume !(main_~i~0 >= 10); 20711#L12-2 assume !(main_~i~0 <= 0); 20710#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20708#L12 assume !(main_~i~0 >= 10); 20707#L12-2 assume !(main_~i~0 <= 0); 20706#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20702#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20703#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 20698#L12-2 [2019-01-14 02:24:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 16 times [2019-01-14 02:24:06,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:06,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:06,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:24:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:07,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:07,000 INFO L82 PathProgramCache]: Analyzing trace with hash 289875998, now seen corresponding path program 16 times [2019-01-14 02:24:07,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:07,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:07,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:07,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:24:07,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:07,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:07,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1498053540, now seen corresponding path program 10 times [2019-01-14 02:24:07,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:07,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:07,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:07,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:24:07,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:24:07,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:24:07,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:24:07,253 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 02:24:07,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 02:24:07,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:24:07,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-01-14 02:24:07,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:24:07,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 02:24:07,811 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 74 [2019-01-14 02:24:07,822 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:24:07,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:24:07,822 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:24:07,822 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:24:07,823 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:24:07,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:07,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:24:07,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:24:07,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration24_Loop [2019-01-14 02:24:07,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:24:07,823 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:24:07,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:07,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:07,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:07,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:07,888 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:24:07,888 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:07,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:24:07,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:24:07,913 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:24:07,913 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_27=1} Honda state: {v_rep~unnamed0~0~true_27=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:07,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:24:07,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:24:07,921 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:24:07,921 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:24:07,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:24:07,941 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:07,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:24:07,969 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:24:07,973 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:24:07,990 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:24:07,990 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:24:07,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:24:07,990 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:24:07,990 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:24:07,990 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:07,991 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:24:07,991 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:24:07,991 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration24_Loop [2019-01-14 02:24:07,991 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:24:07,991 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:24:07,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:08,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:08,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:08,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:08,059 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:24:08,059 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:24:08,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:08,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:08,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:08,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:08,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:08,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:08,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:08,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:08,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:08,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:08,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:08,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:08,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:08,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:08,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:08,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:08,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:08,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:08,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:08,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:08,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:08,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:08,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:08,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:08,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:08,077 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:24:08,078 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:24:08,078 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:24:08,079 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:24:08,082 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:24:08,082 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:24:08,082 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2019-01-14 02:24:08,082 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:24:08,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:08,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:08,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-14 02:24:08,414 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 [2019-01-14 02:24:08,415 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 191 states and 206 transitions. cyclomatic complexity: 18 Second operand 13 states. [2019-01-14 02:24:09,692 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 191 states and 206 transitions. cyclomatic complexity: 18. Second operand 13 states. Result 1203 states and 1246 transitions. Complement of second has 43 states. [2019-01-14 02:24:09,693 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 [2019-01-14 02:24:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:24:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2019-01-14 02:24:09,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 43 letters. Loop has 76 letters. [2019-01-14 02:24:09,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:09,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 119 letters. Loop has 76 letters. [2019-01-14 02:24:09,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:09,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 43 letters. Loop has 152 letters. [2019-01-14 02:24:09,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:09,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1203 states and 1246 transitions. [2019-01-14 02:24:09,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:24:09,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1203 states to 796 states and 837 transitions. [2019-01-14 02:24:09,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 486 [2019-01-14 02:24:09,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2019-01-14 02:24:09,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 796 states and 837 transitions. [2019-01-14 02:24:09,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:24:09,710 INFO L706 BuchiCegarLoop]: Abstraction has 796 states and 837 transitions. [2019-01-14 02:24:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states and 837 transitions. [2019-01-14 02:24:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 464. [2019-01-14 02:24:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-01-14 02:24:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 489 transitions. [2019-01-14 02:24:09,728 INFO L729 BuchiCegarLoop]: Abstraction has 464 states and 489 transitions. [2019-01-14 02:24:09,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 02:24:09,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 02:24:09,728 INFO L87 Difference]: Start difference. First operand 464 states and 489 transitions. Second operand 12 states. [2019-01-14 02:24:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:24:09,919 INFO L93 Difference]: Finished difference Result 388 states and 402 transitions. [2019-01-14 02:24:09,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 02:24:09,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 388 states and 402 transitions. [2019-01-14 02:24:09,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:24:09,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 388 states to 311 states and 325 transitions. [2019-01-14 02:24:09,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2019-01-14 02:24:09,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2019-01-14 02:24:09,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 311 states and 325 transitions. [2019-01-14 02:24:09,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:24:09,929 INFO L706 BuchiCegarLoop]: Abstraction has 311 states and 325 transitions. [2019-01-14 02:24:09,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states and 325 transitions. [2019-01-14 02:24:09,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 115. [2019-01-14 02:24:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-14 02:24:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-01-14 02:24:09,935 INFO L729 BuchiCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-01-14 02:24:09,935 INFO L609 BuchiCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-01-14 02:24:09,935 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2019-01-14 02:24:09,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 126 transitions. [2019-01-14 02:24:09,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-01-14 02:24:09,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:24:09,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:24:09,940 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:24:09,940 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2019-01-14 02:24:09,940 INFO L794 eck$LassoCheckResult]: Stem: 23748#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; 23749#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23796#L12 [2019-01-14 02:24:09,940 INFO L796 eck$LassoCheckResult]: Loop: 23796#L12 assume !(main_~i~0 >= 10); 23795#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 23794#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23793#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23792#L12 assume !(main_~i~0 >= 10); 23791#L12-2 assume !(main_~i~0 <= 0); 23790#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23788#L12 assume !(main_~i~0 >= 10); 23787#L12-2 assume !(main_~i~0 <= 0); 23786#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23785#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23784#L12 assume !(main_~i~0 >= 10); 23783#L12-2 assume !(main_~i~0 <= 0); 23782#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23781#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23780#L12 assume !(main_~i~0 >= 10); 23779#L12-2 assume !(main_~i~0 <= 0); 23778#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23777#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23776#L12 assume !(main_~i~0 >= 10); 23775#L12-2 assume !(main_~i~0 <= 0); 23774#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23772#L12 assume !(main_~i~0 >= 10); 23771#L12-2 assume !(main_~i~0 <= 0); 23770#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23769#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23768#L12 assume !(main_~i~0 >= 10); 23767#L12-2 assume !(main_~i~0 <= 0); 23766#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23764#L12 assume !(main_~i~0 >= 10); 23763#L12-2 assume !(main_~i~0 <= 0); 23762#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23761#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23760#L12 assume !(main_~i~0 >= 10); 23759#L12-2 assume !(main_~i~0 <= 0); 23758#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23756#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 23755#L12-2 assume !(main_~i~0 <= 0); 23747#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23752#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23753#L12 assume !(main_~i~0 >= 10); 23744#L12-2 assume !(main_~i~0 <= 0); 23745#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23750#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23751#L12 assume !(main_~i~0 >= 10); 23754#L12-2 assume !(main_~i~0 <= 0); 23858#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23857#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23856#L12 assume !(main_~i~0 >= 10); 23855#L12-2 assume !(main_~i~0 <= 0); 23854#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23852#L12 assume !(main_~i~0 >= 10); 23851#L12-2 assume !(main_~i~0 <= 0); 23850#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23848#L12 assume !(main_~i~0 >= 10); 23847#L12-2 assume !(main_~i~0 <= 0); 23846#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23844#L12 assume !(main_~i~0 >= 10); 23843#L12-2 assume !(main_~i~0 <= 0); 23842#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23840#L12 assume !(main_~i~0 >= 10); 23839#L12-2 assume !(main_~i~0 <= 0); 23838#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23836#L12 assume !(main_~i~0 >= 10); 23835#L12-2 assume !(main_~i~0 <= 0); 23809#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23806#L12 assume !(main_~i~0 >= 10); 23808#L12-2 assume !(main_~i~0 <= 0); 23807#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23797#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23796#L12 [2019-01-14 02:24:09,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:09,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:24:09,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:09,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:09,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:09,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:24:09,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:09,949 INFO L82 PathProgramCache]: Analyzing trace with hash -950527111, now seen corresponding path program 17 times [2019-01-14 02:24:09,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:09,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:09,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:09,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:09,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:09,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:09,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2117507742, now seen corresponding path program 11 times [2019-01-14 02:24:09,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:09,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:09,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:09,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:24:09,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:10,755 WARN L181 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 74 [2019-01-14 02:24:10,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:24:10 BoogieIcfgContainer [2019-01-14 02:24:10,855 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:24:10,855 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:24:10,855 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:24:10,855 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:24:10,860 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:23:39" (3/4) ... [2019-01-14 02:24:10,863 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:24:10,942 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:24:10,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:24:10,943 INFO L168 Benchmark]: Toolchain (without parser) took 31668.59 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 447.7 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -323.4 MB). Peak memory consumption was 124.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:24:10,944 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:24:10,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.23 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:24:10,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.18 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:24:10,945 INFO L168 Benchmark]: Boogie Preprocessor took 22.80 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:24:10,945 INFO L168 Benchmark]: RCFGBuilder took 265.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:24:10,945 INFO L168 Benchmark]: BuchiAutomizer took 31001.83 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 316.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -171.7 MB). Peak memory consumption was 145.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:24:10,946 INFO L168 Benchmark]: Witness Printer took 87.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:24:10,948 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.23 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 35.18 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.80 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 265.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 31001.83 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 316.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -171.7 MB). Peak memory consumption was 145.0 MB. Max. memory is 11.5 GB. * Witness Printer took 87.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 36 terminating modules (22 trivial, 12 deterministic, 2 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. 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 13 locations. The remainder module has 115 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.9s and 25 iterations. TraceHistogramMax:20. Analysis of lassos took 17.9s. Construction of modules took 5.1s. Büchi inclusion checks took 7.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 35. Automata minimization 0.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 2226 StatesRemovedByMinimization, 35 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 191 states and ocurred in iteration 23. Nontrivial modules had stage [12, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1368/3680 HoareTripleCheckerStatistics: 281 SDtfs, 858 SDslu, 9 SDs, 0 SdLazy, 2372 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc0 concLT10 SILN0 SILU0 SILI9 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax161 hnf97 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq129 hnf96 smp98 dnf100 smp100 tf112 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 28 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 14 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: 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@34f56ad7=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: 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 Loop: [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 [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 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...